- Computing machinery and intelligence.Alan M. Turing - 1950 - Mind 59 (October):433-60.details
|
|
Our knowledge of the external world: as a field for scientific method in philosophy.Bertrand Russell - 1914 - New York: Routledge.details
|
|
Comments on Professor Benacerraf's Paper.James Thomson - 1970 - In Wesley Charles Salmon (ed.), Zeno’s Paradoxes. Indianapolis, IN, USA: Bobbs-Merrill. pp. 130--138.details
|
|
Philosophy of Mathematics and Natural Science.Hermann Weyl - 1949 - Princeton, N.J.: Princeton University Press. Edited by Olaf Helmer-Hirschberg & Frank Wilczek.details
|
|
Word and Object.Willard Van Orman Quine - 1960 - Cambridge, MA, USA: MIT Press.details
|
|
Word and Object.Willard Van Orman Quine, Patricia Smith Churchland & Dagfinn Føllesdal - 1960 - Cambridge, MA, USA: MIT Press.details
|
|
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.details
|
|
Tasks and Supertasks.James Thomson - 1954 - Analysis 15 (1):1--13.details
|
|
Logically possible machines.Eric Steinhart - 2002 - Minds and Machines 12 (2):259-280.details
|
|
Physical hypercomputation and the church–turing thesis.Oron Shagrir & Itamar Pitowsky - 2003 - Minds and Machines 13 (1):87-101.details
|
|
Finite combinatory processes—formulation.Emil L. Post - 1936 - Journal of Symbolic Logic 1 (3):103-105.details
|
|
Elements of the Theory of Computation.Harry R. Lewis & Christos H. Papadimitriou - 1984 - Journal of Symbolic Logic 49 (3):989-990.details
|
|
A completeness theorem in modal logic.Saul Kripke - 1959 - Journal of Symbolic Logic 24 (1):1-14.details
|
|
Deciding arithmetic using SAD computers.Mark Hogarth - 2004 - British Journal for the Philosophy of Science 55 (4):681-691.details
|
|
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.details
|
|
Forever is a day: Supertasks in Pitowsky and Malament-Hogarth spacetimes.John Earman & John D. Norton - 1993 - Philosophy of Science 60 (1):22-42.details
|
|
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.details
|
|
Building infinite machines.E. B. Davies - 2001 - British Journal for the Philosophy of Science 52 (4):671-682.details
|
|
Super turing-machines.B. Jack Copeland - 1998 - Complexity 4 (1):30-32.details
|
|
Physical Computation: How General are Gandy’s Principles for Mechanisms?B. Jack Copeland & Oron Shagrir - 2007 - Minds and Machines 17 (2):217-231.details
|
|
Hypercomputation.B. Jack Copeland - 2002 - Minds and Machines 12 (4):461-502.details
|
|
Beyond the universal Turing machine.B. Jack Copeland & Richard Sylvan - 1999 - Australasian Journal of Philosophy 77 (1):46-66.details
|
|
Beyond the universal Turing machine.Jack Copeland - 1999 - Australasian Journal of Philosophy 77 (1):46-67.details
|
|
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.details
|
|
The paradox of temporal process.R. M. Blake - 1926 - Journal of Philosophy 23 (24):645-654.details
|
|
Tasks, super-tasks, and the modern eleatics.Paul Benacerraf - 1962 - Journal of Philosophy 59 (24):765-784.details
|
|
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 1980 - New York: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.details
|
|
Turing machines.David Barker-Plummer - 2008 - Stanford Encyclopedia of Philosophy.details
|
|
Does General Relativity Allow an Observer to View an Eternity in a Finite Time?Mark Hogarth - 1992 - Foundations Of Physics Letters 5:173--181.details
|
|
The broad conception of computation.Jack Copeland - 1997 - American Behavioral Scientist 40 (6):690-716.details
|
|
Non-Turing Computers and Non-Turing Computability.Mark Hogarth - 1994 - Psa 1994:126--138.details
|
|