| J.L. Casti. Computing the uncomputable, The New Scientist, 154/ |
....processes on quantum dots. We will reduce the problem to a special scattering problem, observe the results of multiple acts of scattering and, finally, estimate the deviation of the scattered data from the input data. 1 Introduction Recently various proposals to break Turing Barrier (see [13, 43, 8, 10]) have been discussed in a series of papers [18, 12, 25] The common denominator of all approaches is the essential use of some physical theory, relativity theory in [18] quantum theory [12, 25] an attitude advocated by Landauer [32, 33] information is inevitably physical) and Deutsch [16, 17] ....
J.L. Casti. Computing the uncomputable, The New Scientist, 154/
....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 [13] Note ....
J. L. Casti. Computing the uncomputable, The New Scientist, 154/2082.
No context found.
J.L. Casti. Computing the uncomputable, The New Scientist, 154/
No context found.
J. L. Casti. Computing the uncomputable, The New Scientist, 154/
No context found.
J.L. Casti. Computing the uncomputable, The New Scientist, 154/2082.
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