The classical simulation of physical processes using standard models of computation is fraught with problems. On the other hand, attempts at modelling real-world computation with ...
We study different computable versions of Baire’s Category Theorem in computable analysis. Similarly, as in constructive analysis, different logical forms of this theorem lead ...
We study what the existence of a classical embedding between computable structures implies about the existence of computable embeddings. In particular, we consider the effect of fi...
Symbolic computation with functions of a real variable suffers from combinatorial explosion of memory and computation time. The alternative chebfun system for such computations is...
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...