Material to categorize
- The Concept of Information for Functions.Yair Lapin - manuscriptdetails
- Elements of the Theory of Computation.Harry Ralph Lewis & Christos H. Papadimitriou - 1981 - Englewood Cliffs, NJ, USA: Prentice-Hall.details
- Halting Problem Undecidability and Infinitely Nested Simulation (V2).P. Olcott - manuscriptdetails
- Solving Equation Systems in Ω-Categorical Algebras.Manuel Bodirsky & Thomas Quinn-Gregson - 2021 - Journal of Mathematical Logic 21 (3).details
- Towards a Theory of Computation Similar to Some Other Scientific Theories.Antonino Drago - manuscriptdetails
- A Coinductive Approach to Proof Search Through Typed Lambda-Calculi.José Espírito Santo, Ralph Matthes & Luís Pinto - 2021 - Annals of Pure and Applied Logic 172 (10):103026.details
- Computing, Modelling, and Scientific Practice: Foundational Analyses and Limitations.Filippos A. Papagiannopoulos - 2018 - Dissertation, University of Western Ontariodetails
- Квантовият компютър: квантовите ординали и типовете алгоритмична неразрешимост.Vasil Penchev - 2005 - Philosophical Alternatives 14 (6):59-71.details
- We Are Less Free Than How We Think: Regular Patterns in Nonverbal Communication.".Alessandro Vinciarelli, Anna Esposito, Mohammad Tayarani, Giorgio Roffo, Filomena Scibelli, Perrone Francesco & Dong BachVo - 2019 - In Multimodal Behavior Analysis in the Wild Advances and Challenges Computer Vision and Pattern Recognition. pp. Pages 269-288.details
- Insights in How Computer Science Can Be a Science.Robert W. P. Luk - 2020 - Science and Philosophy 8 (2):17-46.details
- Intuitionistic Fixed Point Logic.Ulrich Berger & Hideki Tsuiki - 2021 - Annals of Pure and Applied Logic 172 (3):102903.details
- Absolutely No Free Lunches!Gordon Belot - forthcoming - Theoretical Computer Science.details
- How to Be Concrete: Mechanistic Computation and the Abstraction Problem.Luke Kersten - 2020 - Philosophical Explorations 23 (3):251-266.details
- Unrealistic Models for Realistic Computations: How Idealisations Help Represent Mathematical Structures and Found Scientific Computing.Philippos Papayannopoulos - 2020 - Synthese 199 (1-2):249-283.details
- On the Foundations of Computing.Giuseppe Primiero - 2019 - Oxford University Press.details
- Why Be Random?Thomas Icard - 2021 - Mind 130 (517):fzz065.details
- Richard Montague. Towards a General Theory of Computability. Synthese, Vol. 12 No. 4 , Pp. 429–438.Martin Davis - 1964 - Journal of Symbolic Logic 29 (1):63-64.details
- J. Hartmanis, P. M. LewisII, and R. E. Stearns. Classifications of Computations by Time and Memory Requirements. Information Processing 1965, Proceedings of IFIP Congress 65, Organized by the International Federation for Information Processing, New York City, May 24–29,1965, Volume 1, Edited by Wayne A. Kalenich, Spartan Books, Inc., Washington, D.C., and Macmillan and Co., Ltd., London, 1965, Pp. 31–35. [REVIEW]Jiří Bečvář - 1972 - Journal of Symbolic Logic 37 (3):624.details
- Un Sistema di Creatività Computazionale basato su Logiche Non Monotòne per la Generazione di Nuovi Personaggi/Storie/Format in Ambienti Multi-Mediali.Antonio Lieto - forthcoming - In Proceedings of Ital-IA. Rome, Metropolitan City of Rome, Italy: pp. 123-135.details
- Numerical Infinities and Infinitesimals: Methodology, Applications, and Repercussions on Two Hilbert Problems.Yaroslav Sergeyev - 2017 - EMS Surveys in Mathematical Sciences 4 (2):219–320.details
- Notes on Measure and Category in Recursion Theory.Hisao Tanaka - 1970 - Annals of the Japan Association for Philosophy of Science 3 (5):231-241.details
- A Note on Continuous Functionals. Tugu^|^Eacute, Tosiyuki & Sigeru Hinata - 1969 - Annals of the Japan Association for Philosophy of Science 3 (4):138-145.details
- Completeness Properties of Heyting's Predicate Calculus with Respect to Re Models.Dov M. Gabbay - 1976 - Journal of Symbolic Logic 41 (1):81-94.details
- Turing’s Algorithmic Lens: From Computability to Complexity Theory.Josep Díaz & Carme Torras - 2013 - Arbor 189 (764):a080.details
- Physical Computation: A Mechanistic Account. [REVIEW]Joe Dewhurst - 2016 - Philosophical Psychology 29 (5):795-797.details
- Computing and Philosophy: Selected Papers From IACAP 2014.Vincent C. Müller (ed.) - 2016 - Springer.details
- What is Morphological Computation? On How the Body Contributes to Cognition and Control.Vincent C. Müller & Matej Hoffmann - 2017 - Artificial Life 23 (1):1-24.details
- Realizability Semantics for Quantified Modal Logic: Generalizing Flagg’s 1985 Construction.Benjamin G. Rin & Sean Walsh - 2016 - Review of Symbolic Logic 9 (4):752-809.details
- Ramsey-Type Graph Coloring and Diagonal Non-Computability.Ludovic Patey - 2015 - Archive for Mathematical Logic 54 (7-8):899-914.details
- Variable Binding Term Operators.John Corcoran, William Hatcher & John Herring - 1972 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (12):177-182.details
- A Jump Operator in Set Recursion.Dag Normann - 1979 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (13-18):251-264.details
- Sets Completely Creative Via Recursive Permutations.Bruce M. Horowitz - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (25-30):445-452.details
- Strong Computability and Variants of the Uniform Halting Problem.Gabor T. Herman - 1971 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 17 (1):115-131.details
- The Physical Church–Turing Thesis: Modest or Bold?Gualtiero Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733-769.details
- Information and Computation: Essays on Scientific and Philosophical Understanding of Foundations of Information and Computation.Gordana Dodig Crnkovic & Mark Burgin (eds.) - 2011 - World Scientific.details
- Computability and Analysis: The Legacy of Alan Turing.Jeremy Avigad & Vasco Brattka - unknowndetails
- Susan Stuart & Gordana Dodig Crnkovic : 'Computation, Information, Cognition: The Nexus and the Liminal'. [REVIEW]Vincent C. Müller - 2009 - Cybernetics and Human Knowing 16 (3-4):201-203.details
- Representation in Digital Systems.Vincent C. Müller - 2008 - In Adam Briggle, Katinka Waelbers & Brey Philip (eds.), Current Issues in Computing and Philosophy. IOS Press. pp. 116-121.details
- Weak Computability and Representation of Reals.Xizhong Zheng & Robert Rettinger - 2004 - Mathematical Logic Quarterly 50 (45):431-442.details
- Density and Baire Category in Recursive Topology.Iraj Kalantari & Larry Welch - 2004 - Mathematical Logic Quarterly 50 (45):381-391.details
- Computational Complexity of Solving Equation Systems.Przemysław Broniek - unknowndetails
- Levels of Discontinuity, Limit-Computability, and Jump Operators.de Brecht Matthew - 2014 - In Dieter Spreen, Hannes Diener & Vasco Brattka (eds.), Logic, Computation, Hierarchies. De Gruyter. pp. 79-108.details
- Elements of the Theory of Computation Harry R. Lewis, Christos H. Papadimitriou.Harry R. Lewis & Christos H. Papadimitriou - 1998details
- Gary R. Collins, "Psychology Series for Church Leaders". Vol. II. "Effective Counselling". [REVIEW]William J. Nessel - 1973 - The Thomist 37 (1):262.details
- Finite Automata, Formal Logic, and Circuit Complexity.Howard Straubing - 1994 - Birkhäuser.details
- Communication Complexity.Eyal Kushilevitz & Noam Nisan - 1997 - Cambridge University Press.details
- Degrees of Unsolvability.Gerald E. Sacks - 1963 - Princeton University Press.details
- Recursive Analysis. [REVIEW]H. T. R. - 1964 - Review of Metaphysics 18 (1):174-174.details
- Formal Systems and Recursive Functions. [REVIEW]J. M. P. - 1965 - Review of Metaphysics 19 (1):161-162.details
- The Equivalence of Bar Recursion and Open Recursion.Thomas Powell - 2014 - Annals of Pure and Applied Logic 165 (11):1727-1754.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
|
|