Sciweavers

3690 search results - page 44 / 738
» Computation with classical sequents
Sort
View
AMC
2006
114views more  AMC 2006»
14 years 9 months ago
Definability as hypercomputational effect
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 ...
S. Barry Cooper
MFCS
2001
Springer
15 years 2 months ago
Computable Versions of Baire's Category Theorem
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 ...
Vasco Brattka
NDJFL
2010
14 years 4 months ago
Embeddings of Computable Structures
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...
Asher M. Kach, Oscar Levin, Reed Solomon
ISSAC
2007
Springer
149views Mathematics» more  ISSAC 2007»
15 years 3 months ago
Computing numerically with functions instead of numbers
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...
Lloyd N. Trefethen
ECCC
2010
103views more  ECCC 2010»
14 years 9 months ago
Time-Space Efficient Simulations of Quantum Computations
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...
Dieter van Melkebeek, Thomas Watson