- Fuzzy Time, From Paradox to Paradox.Farzad Didehvar - manuscriptdetails
- Is Classical Mathematics Appropriate for Theory of Computation?Farzad Didehvar - manuscriptdetails
- A Contradiction and P=NP Problem.Farzad Didehvar - manuscriptdetails
- Halting Problem Undecidability and Infinitely Nested Simulation (V4).P. Olcott - manuscriptdetails
- Halting Problem Undecidability and Infinitely Nested Simulation (V5).P. Olcott - manuscriptdetails
- Halting Problem Undecidability and Infinitely Nested Simulation.P. Olcott - manuscriptdetails
- Halting Problem Undecidability and Infinitely Nested Simulation (V3).P. Olcott - manuscriptdetails
- Randomness is Unpredictability.Jon Williamson - manuscriptdetails
- Computability and the Symmetric Difference Operator.Uri Andrews, Peter M. Gerdes, Steffen Lempp, Joseph S. Miller & Noah D. Schweber - forthcoming - Logic Journal of the IGPL.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
- Strengthening Weak Emergence.Nora Berenstain - forthcoming - Erkenntnis:1-18.details
- Computability: Gödel, Turing, Church, and Beyond.B. J. Copeland, C. Posy & O. Shagrir (eds.) - forthcoming - MIT Press.details
- Explaining Experience In Nature: The Foundations Of Logic And Apprehension.Steven Ericsson-Zenith - forthcoming - Institute for Advanced Science & Engineering.details
- Reviewed Work(S): Lowness Properties and Randomness. Advances in Mathematics, Vol. 197 by André Nies; Lowness for the Class of Schnorr Random Reals. SIAM Journal on Computing, Vol. 35 by Bjørn Kjos-Hanssen; André Nies; Frank Stephan; Lowness for Kurtz Randomness. The Journal of Symbolic Logic, Vol. 74 by Noam Greenberg; Joseph S. Miller; Randomness and Lowness Notions Via Open Covers. Annals of Pure and Applied Logic, Vol. 163 by Laurent Bienvenu; Joseph S. Miller; Relativizations of Randomness and Genericity Notions. The Bulletin of the London Mathematical Society, Vol. 43 by Johanna N. Y. Franklin; Frank Stephan; Liang Yu; Randomness Notions and Partial Relativization. Israel Journal of Mathematics, Vol. 191 by George Barmpalias; Joseph S. Miller; André Nies. [REVIEW]Johanna N. Y. Franklin - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.details
- Computability as a Physical Modality.Tamara Horowitz - forthcoming - Unpublished Ms Held in the Casimir Lewy Library, Cambridge.details
- Expression de la Recursion Primitive Dans le Calcul-XK.J. Ladriere - forthcoming - Logique Et Analyse.details
- Conference on Computability, Complexity and Randomness: Isaac Newton Institute, Cambridge, Uk July 2-6, 2012.Elvira Mayordomo & Wolfgang Merkle - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.details
- Variations on Determinacy And.Ramez L. Sami - forthcoming - Journal of Symbolic Logic:1-10.details
- A Note on the Learning-Theoretic Characterizations of Randomness and Convergence.Tomasz Steifer - forthcoming - Review of Symbolic Logic:1-15.details
- Taming Koepke's Zoo II: Register Machines.Merlin Carl - 2022 - Annals of Pure and Applied Logic 173 (3):103041.details
- Relationships Between Computability-Theoretic Properties of Problems.Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey & Dan Turetsky - 2022 - Journal of Symbolic Logic 87 (1):47-71.details
- Degrees of Randomized Computability.Rupert Hölzl & Christopher P. Porter - 2022 - Bulletin of Symbolic Logic 28 (1):27-70.details
- Computability, Notation, and de Re Knowledge of Numbers.Stewart Shapiro, Eric Snyder & Richard Samuels - 2022 - Philosophies 1 (7).details
- Computability, Notation, and de Re Knowledge of Numbers.Stewart Shapiro, Eric Snyder & Richard Samuels - 2022 - Philosophies 7 (20):20.details
- Computability and the game of cops and robbers on graphs.Rachel D. Stahl - 2022 - Archive for Mathematical Logic 61 (3):373-397.details
- Complexity of Syntactical Tree Fragments of Independence-Friendly Logic.Fausto Barbero - 2021 - Annals of Pure and Applied Logic 172 (1):102859.details
- Completion of Choice.Vasco Brattka & Guido Gherardi - 2021 - Annals of Pure and Applied Logic 172 (3):102914.details
- Incompleteness and the Halting Problem.Cristian S. Calude - 2021 - Studia Logica 109 (5):1159-1169.details
- Connecting with Computability. CiE 2021. Lecture Notes in Computer Science, Vol 12813.L. De Mol, A. Weiermann, F. Manea & D. Fernández-Duque (eds.) - 2021details
- Connecting with Computability. Proceedings of Computability in Europe.Liesbeth De Mol, Andreas Weiermann, Florin Manea & David Fernández-Duque (eds.) - 2021details
- Computable Irrational Numbers with Representations of Surprising Complexity.Ivan Georgiev, Lars Kristiansen & Frank Stephan - 2021 - Annals of Pure and Applied Logic 172 (2):102893.details
- Intrinsic Smallness.Justin Miller - 2021 - Journal of Symbolic Logic 86 (2):558-576.details
- Computable Analogs of Cardinal Characteristics: Prediction and Rearrangement.Iván Ongay-Valverde & Paul Tveite - 2021 - Annals of Pure and Applied Logic 172 (1):102872.details
- Computability of Diagrammatic Theories for Normative Positions.Matteo Pascucci & Giovanni Sileno - 2021 - In Erich Schweighofer (ed.), Proceedings of JURIX 2021: 34th International Conference on Legal Knowledge and Information Systems. IOS Press. pp. 171-180.details
- The Characterization of Weihrauch Reducibility in Systems Containing.Patrick Uftring - 2021 - Journal of Symbolic Logic 86 (1):224-261.details
- Weaker Variants of Infinite Time Turing Machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.details
- Computability, Orders, and Solvable Groups.Arman Darbinyan - 2020 - Journal of Symbolic Logic 85 (4):1588-1598.details
- Computable Linear Orders and Products.Andrey N. Frolov, Steffen Lempp, Keng Meng Ng & Guohua Wu - 2020 - Journal of Symbolic Logic 85 (2):605-623.details
- Cupping and Jump Classes in the Computably Enumerable Degrees.Noam Greenberg, Keng Meng Ng & Guohua Wu - 2020 - Journal of Symbolic Logic 85 (4):1499-1545.details
- Computability of Polish Spaces Up to Homeomorphism.Matthew Harrison-Trainor, Alexander Melnikov & Keng Meng Ng - 2020 - Journal of Symbolic Logic 85 (4):1664-1686.details
- A Minimal Pair in the Generic Degrees.Denis R. Hirschfeldt - 2020 - Journal of Symbolic Logic 85 (1):531-537.details
- Term-Space Semantics of Typed Lambda Calculus.Ryo Kashima, Naosuke Matsuda & Takao Yuyama - 2020 - Notre Dame Journal of Formal Logic 61 (4):591-600.details
- Pincherle's Theorem in Reverse Mathematics and Computability Theory.Dag Normann & Sam Sanders - 2020 - Annals of Pure and Applied Logic 171 (5):102788.details
- Computability in Partial Combinatory Algebras.Sebastiaan A. Terwijn - 2020 - Bulletin of Symbolic Logic 26 (3-4):224-240.details
- Hilbert's 10th Problem for Solutions in a Subring of Q.Agnieszka Peszek & Apoloniusz Tyszka - 2019 - Scientific Annals of Computer Science 29 (1):101-111.details
- Review of 'The Outer Limits of Reason' by Noson Yanofsky 403p (2013) (Review Revised 2019).Michael Starks - 2019 - In Suicidal Utopian Delusions in the 21st Century -- Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2019 4th Edition Michael Starks. Las Vegas, NV USA: Reality Press. pp. 299-316.details
- Wolpert, Chaitin e Wittgenstein em impossibilidade, incompletude, o paradoxo do mentiroso, o teísmo, os limites da computação, um princípio de incerteza mecânica não quântica e o universo como computador — o teorema final na teoria da máquina de Turing (revisado 2019).Michael Richard Starks - 2019 - In Delírios Utópicos Suicidas no Século XXI Filosofia, Natureza Humana e o Colapso da Civilization- Artigos e Comentários 2006-2019 5ª edição. Las Vegas, NV USA: Reality Press. pp. 183-187.details
- Counterpossibles in Science: The Case of Relative Computability.Matthias Jenny - 2018 - Noûs 52 (3):530-560.details
- On the Question of Whether the Mind Can Be Mechanized, I: From Gödel to Penrose.Peter Koellner - 2018 - Journal of Philosophy 115 (7):337-360.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
|
|