![]() |
|
|
| |
|
||||
Super-Turing computation is any form of computation that cannot be performed by a finite Turing machine. This includes, but is not limited to:
No physical examples of Super-Turing computers are currently known. Classes of computers that might have Super-Turing capabilities in some physical models include: Difference between super-Turing computation and HypercomputationSuper-Turing computation is any form of information processing that a turing machine cannot do. There are no restrictions on the class of super-Turing machines beyond this. Hypercomputation is a sub-class of super-Turing computation, which meets a further set of mathematical restrictions. In other words,
Thus, if a given property does not belong to the class of Hypercomputers, that does not imply that it does not belong to a given instance in the class of super-Turing computers. (see Venn diagram) External links
|
|
|
|
|
|
|
|
Copyright 2008 WordIQ.com - Privacy Policy
::
Terms of Use
:: Contact Us
:: About Us This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Super-Turing computation". |