|
|
|
|
|
Super-turing ComputationSuper-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 Hypercomputation Super-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 is able to compute functions. In other words, not all super-Turing machines are Hypercomputers, but all Hypercomputers are super-Turing machines. An example of a putative Super-Turing computation which is not a hypercomputation in this sense would be one of Hava Siegelman's neural networks; these have the ability to recognize nonrecursive languages, but there is no clear method by which they can compute more general non-recursive functions (i.e. not two-valued). Another example might be an alternating or non-deterministic Turing machine; under the (as yet unproven) hypothesis that P≠NP, these produce super-Turing computation because they have a larger class of polynomial time functions; but they are not hypercomputers because they cannot compute anything nonrecursive. External links * The simple dynamics of super Turing theories
|
 |
|
| Copyright 2005-2009 OnPedia.com. All Rights Reserved |
|
|