J. Copeland. Even Turing machines can compute uncomputable functions. In J. Casti, C. Calude, and M. Dinneen, editors, Unconventional Models of Computation (UMC'98), pages 150--164, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Beyond The Universal Turing Machine - Copeland, Sylvan (1998) (5 citations) Self-citation (Copeland) (Correct)
....idealisations ( notional machines) Accumulator machines, Scarpellini type machines, O machines, coupled Turing machines, asynchronous networks of Turing machines, and heterodox connectionist networks are described in what follows. For discussion of accelerating digital machines and the GPAC see Copeland 1997, 1998c, 1998d. 2 Our conjectural location of certain biological systems on the 2 Also of interest are Mark Hogarth s anti de Sitter machines (Hogarth 1992, 1994) 7 heterodox side of the diagram reflects our belief that for all that is currently known the human brain could turn out to be a ....
.... location of certain biological systems on the 2 Also of interest are Mark Hogarth s anti de Sitter machines (Hogarth 1992, 1994) 7 heterodox side of the diagram reflects our belief that for all that is currently known the human brain could turn out to be a heterodox computing device (see Copeland 1997 and 1998a for development of this theme) There is an algorithm or effective procedure or method for solving a class of problems if and only if there is a program for some computing machine which will cause the machine to produce a correct answer for each problem in the class. The general requirements ....
[Article contains additional citation context not shown here]
Copeland, B.J. 1998c. 'Even Turing Machines Can Compute Uncomputable Functions'. In Calude, Casti, Dinneen 1998.
Super Turing-Machines - Copeland Self-citation (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 ....
Copeland, B.J. 1998. 'Even Turing Machines Can Compute Uncomputable Functions'. In Calude, C.S., Casti, J., Dinneen, M.J. (eds) 1998, Unconventional Models of Computation, Singapore: Springer-Verlag.
Some recent developments on Shannon's General Purpose Analog.. - Graca (2004) (1 citation) (Correct)
No context found.
J. Copeland. Even Turing machines can compute uncomputable functions. In J. Casti, C. Calude, and M. Dinneen, editors, Unconventional Models of Computation (UMC'98), pages 150--164, 1998.
Bio-Steps Beyond Turing - Calude, Paun (2004) (Correct)
No context found.
B.J. Copeland. Even Turing machines can compute uncomputable functions, C.S. Springer-Verlag, Singapore, 1998, 150--164.
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