computability theory, the theory of real computation deals with hypothetical computing machines using infinite-precision real numbers. They are given this name...

and Real Computation is a book on the computational complexity theory of real computation. It studies algorithms whose inputs and outputs are real numbers...

A computation is any type of arithmetic or non-arithmetic calculation that is well-defined. Common examples of computation are mathematical equation solving...

and mathematician who has made contributions to the theories of real number computation, cryptography, and pseudorandom number generation. She was a distinguished...

Hypercomputation or super-Turing computation is a set of hypothetical models of computation that can provide outputs that are not Turing-computable. For...

Secure multi-party computation (also known as secure computation, multi-party computation (MPC) or privacy-preserving computation) is a subfield of cryptography...

{\displaystyle \alpha } -1)-sphere. In the Blum–Shub–Smale model of real computation, the Mandelbrot set is not computable, but its complement is computably...

describe computations over the real numbers. Essentially, a BSS machine is a Random Access Machine with registers that can store arbitrary real numbers...

mechanical computation. While they can express arbitrary computations, their minimalist design makes them too slow for computation in practice: real-world...

In computer science, evolutionary computation is a family of algorithms for global optimization inspired by biological evolution, and the subfield of...