- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Foundational analyses of computation
In S. Barry Cooper (ed.), How the World Computes. pp. 264--275 (2012)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Randomness, computation and mathematics.Rod Downey - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 162--181.
Subsymbolic computation theory for the human intuitive processor.Paul Smolensky - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 675--685.
Egon Boerger, Erich Graedel, and Yuri Gurevich, The Classical Decision Problem.M. Marx - 1999 - Journal of Logic Language and Information 8:478-481.
Yuri Gurevich and Saharon Shelah. On finite rigid structures. The journal of symbolic logic, vol. 61 , pp. 549–562. [REVIEW]Alexei P. Stolboushkin - 2000 - Bulletin of Symbolic Logic 6 (3):353-355.
The classical decision problem, Egon börger, Erich grädel, and Yuri Gurevich.Maarten Marx - 1999 - Journal of Logic, Language and Information 8 (4):478-481.
Computability and Complexity: From a Programming Perspective Vol. 21.N. D. Jones - 1997 - MIT Press.
The computing spacetime.Fotini Markopoulou - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 472--484.
Compactness and the Effectivity of Uniformization.Robert Rettinger - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 616--625.
On Mathias generic sets.Peter A. Cholak, Damir D. Dzhafarov & Jeffry L. Hirst - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 129--138.
Analytics
Added to PP
2014-01-28
Downloads
176 (#134,446)
6 months
5 (#1,013,271)
2014-01-28
Downloads
176 (#134,446)
6 months
5 (#1,013,271)
Historical graph of downloads
Citations of this work
On Floridi’s Method of Levels of Abstraction.Jan van Leeuwen - 2014 - Minds and Machines 24 (1):5-17.
Explication as a Three-Step Procedure: the case of the Church-Turing Thesis.Matteo De Benedetto - 2021 - European Journal for Philosophy of Science 11 (1):1-28.
Frameworks, models, and case studies: a new methodology for studying conceptual change in science and philosophy.Matteo De Benedetto - 2022 - Dissertation, Ludwig Maximilians Universität, München
References found in this work
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.
A natural axiomatization of computability and proof of Church’s thesis.Nachum Dershowitz & Yuri Gurevich - 2008 - Bulletin of Symbolic Logic 14 (3):299-350.
Effective Computation by Humans and Machines.Shagrir Oron - 2002 - Minds and Machines 12 (2):221-240.
Church's Thesis and Principles for Mechanisms.Robin Gandy - 1980 - In The Kleene Symposium. North-Holland. pp. 123--148.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-wmc4m dc2