Sciweavers

457 search results - page 2 / 92
» Hypercomputation: computing more than the Turing machine
Sort
View
AMC
2006
131views more  AMC 2006»
13 years 5 months ago
How much can analog and hybrid systems be proved (super-)Turing
Church thesis and its variants say roughly that all reasonable models of computation do not have more power than Turing machines. In a contrapositive way, they say that any model ...
Olivier Bournez
FUNGAMES
2008
13 years 6 months ago
Hypercomputation, Unconsciousness and Entertainment Technology
Recent developments in computer science introduce and discuss new concepts for computation beyond universal Turing machines. Quantum computing relates to new insights in quantum ph...
Matthias Rauterberg
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
13 years 9 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
FSS
2008
127views more  FSS 2008»
13 years 5 months ago
On the computing power of fuzzy Turing machines
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...
Benjamín René Callejas Bedregal, San...
JAPLL
2008
96views more  JAPLL 2008»
13 years 5 months ago
Simulating Turing machines on Maurer machines
Maurer machines are much closer to real computers than Turing machines. Computer instructions play a prominent part in Maurer machines. We show a straightforward way to simulate Tu...
Jan A. Bergstra, C. A. Middelburg