Stewart, I. (1991). Deciding the undecidable. Nature, 352:664--665. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Computing a Glimpse of Randomness - Calude, Dinneen, Shu (2002) (7 citations) (Correct)
....Full description of programs and proofs will be given elsewhere. 1 Introduction Any attempt to compute the uncomputable or to decide the undecidable is without doubt challenging, but hardly new (see, for example, Marxen and Buntrock [25] Stewart [33], Casti [11] This paper describes a hybrid procedure (which combines Java programming and mathematical proofs) for computing the exact values of the first 64 bits of a concrete Chaitin Omega number,# U , the halting probability of the universal Chaitin (self delimiting Turing) machine U , see ....
I. Stewart. Deciding the undecidable, Nature 352 (1991), 664--665.
Even Turing Machines Can Compute Uncomputable Functions - Copeland (1998) (2 citations) (Correct)
....upon a Turing machine produces an accelerated Turing machine. These are Turing machines that perform the second primitive operation called for by the program in half the time taken to perform the first, the third in half the time taken to perform the second, and so on. 3 Let the time taken to 3 Stewart (1991: 664 5) gives a cameo discussion of such machines. Related to accelerated Turing machines are the anti de Sitter machines of Hogarth (1994) and the Zeus machines of Boolos and Jeffrey (1980: 14 15) The term anti de Sitter machine is from Copeland and Sylvan 1997. Hogarth s own term for his ....
Stewart, I. 1991. 'Deciding the Undecidable'. Nature, 352, 664-5.
Super Turing-Machines - Copeland (Correct)
....Turing machine program or is a well formed program that does not terminate. I will refer to this task as the terminating program test or TP test. It is false that no conceivable machine can carry out the TP test. An AUTM, or Accelerating Universal Turing Machine, can carry out this task [1, 2, 3]. An AUTM executes the program on its tape at an accelerating rate, performing each atomic operation that the program calls for in half the time that was taken for the immediately preceding atomic operation. So if the machine takes one unit of time to perform the first atomic operation that the ....
Stewart, I. 1991. 'Deciding the Undecidable'. Nature, 352, 664-5.
A Transformation Framework for Solving Artificial Life Systems .. - GopalaKrishna (2005) (Correct)
No context found.
Stewart, I. (1991). Deciding the undecidable. Nature, 352:664--665.
Bio-Steps Beyond Turing - Calude, Paun (2004) (Correct)
No context found.
I. Stewart. Deciding the undecidable, Nature, 352 (1991), 664--665.
Incompleteness, Complexity, Randomness and Beyond - Calude (2002) (Correct)
No context found.
I. Stewart. Deciding the undecidable, Nature 352 (1991), 664--665.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC