- Chapter Twelve Growing Minds, Computability, and the Potentially Infinite Darren Abramson.Darren Abramson - 2007 - In Soraj Hongladarom (ed.), Computing and Philosophy in Asia. Cambridge Scholars Press. pp. 179.details
- A Paradox Related to the Turing Test.Samuel Alexander - 2011 - The Reasoner 5 (6):90-90.details
- Formulas for Computable and Non-Computable Functions.Samuel Alexander - 2006 - Rose-Hulman Undergraduate Mathematics Journal 7 (2).details
- Computability in Europe 2009.Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss & Benedikt Löwe - 2012 - Annals of Pure and Applied Logic 163 (5):483-484.details
- Approximation to a Decision Procedure for the Halting Problem.Michael Anderson - 1968 - Notre Dame Journal of Formal Logic 9 (4):305-312.details
- Predicatively Computable Functions on Sets.Toshiyasu Arai - 2015 - Archive for Mathematical Logic 54 (3-4):471-485.details
- The Changing Practices of Proof in Mathematics.Andrew Arana - forthcoming - Metascience:1-5.details
- Review of Computability: Turing, Gödel, Church, and Beyond. [REVIEW]Andrew Arana - 2015 - Notre Dame Philosophical Reviews 3 (20).details
- Possible M-Diagrams of Models of Arithmetic.Andrew Arana - 2005 - In Stephen Simpson (ed.), Reverse Mathematics 2001.details
- Non-Classical Logics, Model Theory, and Computability Proceedings of the Third Latin-American Symposium on Mathematical Logic, Campinas, Brazil, July 11-17, 1976. [REVIEW]Ayda I. Arruda, R. Chuaqui & Newton C. A. da Costa - 1977 - details
- Non-Classical Logics, Model Theory, and Computability: Proceedings of the Third Latin-American Symposium on Mathematical Logic, Campinas, Brazil, July 11-17, 1976. [REVIEW]Ayda I. Arruda, Newton C. A. Costa & R. Chuaqui (eds.) - 1977 - Sale Distributors for the U.S.A. And Canada, Elsevier/North-Holland.details
- Recursion Theory and Complexity: Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14-19, 1997.M. M. Arslanov & Steffen Lempp (eds.) - 1999 - W. De Gruyter.details
- Computability and Convergence.Jeremy Avigad - unknown - details
- Local Stability of Ergodic Averages.Jeremy Avigad - unknown - details
- Computability and Analysis: The Legacy of Alan Turing.Jeremy Avigad & Vasco Brattka - unknown - details
- Algorithmic Randomness, Reverse Mathematics, and the Dominated Convergence Theorem.Jeremy Avigad, Edward T. Dean & Jason Rute - 2012 - Annals of Pure and Applied Logic 163 (12):1854-1864.details
- A Non-Deterministic View on Non-Classical Negations.Arnon Avron - 2005 - Studia Logica 80 (2-3):159-194.details
- Local Realizability Toposes and a Modal Logic for Computability.Steve Awodey, Lars Birkedal & Dana Scott - unknown - details
- Iteration of Primitive Recursion.Paul Axt - 1965 - Mathematical Logic Quarterly 11 (3):253-255.details
- Note on the 3‐Recursive Functions.Paul Axt - 1961 - Mathematical Logic Quarterly 7 (7‐10):97-98.details
- Note on the 3-Recursive Functions.Paul Axt - 1961 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 7 (7-10):97-98.details
- Evolutionary Scenarios for the Emergence of Recursion.Lluís Barceló-Coblijn - forthcoming - Theoria Et Historia Scientiarum 9:171-199.details
- Algorithmic Randomness and Measures of Complexity.George Barmpalias - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.details
- Algorithmic Randomness of Continuous Functions.George Barmpalias, Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel & Rebecca Weber - 2008 - Archive for Mathematical Logic 46 (7-8):533-546.details
- Two Constructive Embedding‐Extension Theorems with Applications to Continuity Principles and to Banach‐Mazur Computability.Andrej Bauer & Alex Simpson - 2004 - Mathematical Logic Quarterly 50 (4‐5):351-369.details
- Logic, Computability, and Randomness.Verónica Becher - 2005 - Bulletin of Symbolic Logic 11 (4):557-557.details
- Conference on Computability, Complexity and Randomness.Verónica Becher, C. T. Chong, Rod Downey, Noam Greenberg, Antonin Kucera, Bjørn Kjos-Hanssen, Steffen Lempp, Antonio Montalbán, Jan Reimann & Stephen Simpson - 2008 - Bulletin of Symbolic Logic 14 (4):548-549.details
- On the Induction Schema for Decidable Predicates.Lev D. Beklemishev - 2003 - Journal of Symbolic Logic 68 (1):17-34.details
- On the Correct Definition of Randomness.Paul Benioff - 1978 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1978:63 - 78.details
- N-Ary Almost Recursive Functions.John W. Berry - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (34-36):551-559.details
- Constructive Equivalence Relations on Computable Probability Measures.Laurent Bienvenu & Wolfgang Merkle - 2009 - Annals of Pure and Applied Logic 160 (3):238-254.details
- Randomness and Lowness Notions Via Open Covers.Laurent Bienvenu & Joseph S. Miller - 2012 - Annals of Pure and Applied Logic 163 (5):506-518.details
- Non Recursive Functionals.Richard Bird - 1975 - Mathematical Logic Quarterly 21 (1):41-46.details
- Remarks on Gregory's “Actually” Operator.Patrick Blackburn & Maarten Marx - 2002 - Journal of Philosophical Logic 31 (3):281-288.details
- Computability and Logic.S. Boolos George, P. Burgess John & C. Jeffrey Richard - 2007 - Cambridge University Press.details
- Computability and Logic.George S. Boolos, John P. Burgess & Richard C. Jeffrey - 2007 - Cambridge University Press.details
- Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 2007 - Cambridge University Press.details
- Computability, Complexity, Logic.E. Börger - 1989 - New York: U.S.A.Elsevier Science Pub. Co..details
- Emergence and Computability.Fabio Boschetti & Randall Gray - 2007 - Emergence: Complexity and Organization 9.details
- Computability of Solutions of Operator Equations.Volker Bosserhoff - 2007 - Mathematical Logic Quarterly 53 (4):326-344.details
- A Computable Version of Banach's Inverse Mapping Theorem.Vasco Brattka - 2009 - Annals of Pure and Applied Logic 157 (2):85-96.details
- Borel Complexity and Computability of the Hahn–Banach Theorem.Vasco Brattka - 2008 - Archive for Mathematical Logic 46 (7-8):547-564.details
- Effective Borel Measurability and Reducibility of Functions.Vasco Brattka - 2005 - Mathematical Logic Quarterly 51 (1):19-44.details
- Computability of Finite-Dimensional Linear Subspaces and Best Approximation.Vasco Brattka & Ruth Dillhage - 2010 - Annals of Pure and Applied Logic 162 (3):182-193.details
- A Study on Universal Functions.Bruno Buchberger - 1972 - Institut für Numerische Mathematik Und Elektronische Informationsverarbeitung, Universität Innsbruck.details
- Computability in Europe 2011.Sam Buss, Benedikt Löwe, Dag Normann & Ivan Soskov - 2013 - Annals of Pure and Applied Logic 164 (5):509-510.details
- The Theory of Computability Developed in Terms of Satisfaction.James Cain - 1999 - Notre Dame Journal of Formal Logic 40 (4):515-532.details
- Real Numbers: From Computable to Random.Cristian Calude - 2001 - Studia Philosophica 1.details
- Topological Size of Sets of Partial Recursive Functions.Cristian Calude - 1982 - Mathematical Logic Quarterly 28 (27‐32):455-462.details
- Combinatorics, Computability and Logic Proceedings of the Third International Conference on Combinatorics, Computability and Logic.Cristian Calude, M. J. Dinneen & Silviu Sburlan - 2001 - details
|
Off-campus access
Using PhilPapers from home?
Create an account to enable off-campus access through your institution's proxy server.
Monitor this page
Be alerted of all new items appearing on this page. Choose how you want to monitor it:
Email
|
RSS feed
|
|