The Broad Conception Of Computation (1997)

by B. Jack Copeland
Venue:American Behavioral Scientist
Citations:11 - 2 self

Documents Related by Co-Citation

1161 On computable numbers with an application to the Entscheidungsproblem – A Turing - 1936
125 System of logics based on ordinals – A M Turing - 1939
75 A.Lewis, Infinite time turing machines – Joel David Hamkins, Andy Lewis
63 Computation Beyond the Turing Limit – H T Siegelmann - 1995
31 Hypercomputation: computing more than the Turing machine – Toby Ord - 2002
15 Even Turing Machines Can Compute Uncomputable Functions – B. Jack Copeland - 1998
30 X-Machines and the Halting Problem: Building a super-Turing Machine – Mike Stannett - 1990
382 On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines – L Blum, M Shub, S Smale - 1989
43 general relativity allow an observer to view an eternity in a finite time – Mark L. Hogarth - 1992
265 An unsolvable problem of elementary number theory – A Church - 1936
31 Beyond The Universal Turing Machine – B. Jack Copeland, Richard Sylvan - 1998
656 Quantum theory, the Church-Turing principle and the universal quantum computer – David Deutsch - 1985
38 The Church–Turing Thesis – B J Copeland - 1997
19 The limits of empiricism – B A W Russell - 1936
21 Computability and Physical Theories – R Geroch, J B Hartle - 1986
87 Analog Computation via Neural Networks – Hava T. Siegelmann, Eduardo D. Sontag - 1994
36 The complexity of analog computation – Anastasios Vergis, Kenneth Steiglitz
3 Unconventional Models of Computation, chapter Even Turing Machines Can Compute Uncomputable Functions – Jack Copeland - 1998
2 A Formalisation of Non-Finite Computation. M.Phil dissertation – Lucian Wischik - 1997