- 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
Some notes on Church's thesis and the theory of games
Theory and Decision 29 (1):19-52 (1990)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
The Church-Turing Thesis.B. Jack Copeland - 2014 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. Stanford, CA: The Metaphysics Research Lab.
On the Provability, Veracity, and AI-Relevance of the Church-Turing Thesis.Selmer Bringsjord & Konstantine Arkoudas - 2006 - In A. Olszewski, J. Wole'nski & R. Janusz (eds.), Church's Thesis After Seventy Years. Ontos Verlag. pp. 68-118.
The Church-Turing Thesis: A last vestige of a failed mathematical program.Carol Cleland - 2006 - In A. Olszewski, J. Wole'nski & R. Janusz (eds.), Church's Thesis After Seventy Years. Ontos Verlag. pp. 119-146.
SAD computers and two versions of the Church–Turing thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
Thinking machines: Some fundamental confusions. [REVIEW]John T. Kearns - 1997 - Minds and Machines 7 (2):269-87.
Turing-, human- and physical computability: An unasked question. [REVIEW]Eli Dresner - 2008 - Minds and Machines 18 (3):349-355.
Paradox and Potential Infinity.Charles McCarty - 2013 - Journal of Philosophical Logic 42 (1):195-219.
Congestion models and weighted Bayesian potential games.Giovanni Facchini, Freek van Megen, Peter Borm & Stef Tijs - 1997 - Theory and Decision 42 (2):193-206.
The Church-Turing ‘Thesis’ as a Special Corollary of Gödel’s Completeness Theorem.Saul A. Kripke - 2013 - In B. J. Copeland, C. Posy & O. Shagrir (eds.), Computability: Gödel, Turing, Church, and beyond. MIT Press.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Analytics
Added to PP
2013-01-04
Downloads
54 (#289,891)
6 months
8 (#347,798)
2013-01-04
Downloads
54 (#289,891)
6 months
8 (#347,798)
Historical graph of downloads
Citations of this work
On the logic of common belief and common knowledge.Luc Lismont & Philippe Mongin - 1994 - Theory and Decision 37 (1):75-106.
Common reasoning in games: A Lewisian analysis of common knowledge of rationality.Robin P. Cubitt & Robert Sugden - 2014 - Economics and Philosophy 30 (3):285-329.
Undecidability in the imitation game.Y. Sato & T. Ikegami - 2004 - Minds and Machines 14 (2):133-43.
Incomplete Contracts and Complexity Costs.Luca Anderlini & Leonardo Felli - 1999 - Theory and Decision 46 (1):23-50.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.
Semantical Analysis of Modal Logic I. Normal Propositional Calculi.Saul A. Kripke - 1963 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (5‐6):67-96.
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-7c76586df8-hc2g5 uwo