- P f≠ NP f for almost all f.Joel David Hamkins & Philip D. Welch - 2003 - Mathematical Logic Quarterly 49 (5):536-540.details
|
|
Do Accelerating Turing Machines Compute the Uncomputable?B. Jack Copeland & Oron Shagrir - 2011 - Minds and Machines 21 (2):221-239.details
|
|
Ideal Negative Conceivability and the Halting Problem.Manolo Martínez - 2013 - Erkenntnis 78 (5):979-990.details
|
|
On the Possibilities of Hypercomputing Supertasks.Vincent C. Müller - 2011 - Minds and Machines 21 (1):83-96.details
|
|
A note on theories for quasi-inductive definitions.Riccardo Bruni - 2009 - Review of Symbolic Logic 2 (4):684-699.details
|
|
SAD computers and two versions of the Church–Turing thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.details
|
|
The diagonal method and hypercomputation.Toby Ord & Tien D. Kieu - 2005 - British Journal for the Philosophy of Science 56 (1):147-156.details
|
|
Supermachines and superminds.Eric Steinhart - 2003 - Minds and Machines 13 (1):155-186.details
|
|
Turing computations on ordinals.Peter Koepke - 2005 - Bulletin of Symbolic Logic 11 (3):377-397.details
|
|
Editorial introduction.Volker Halbach - 2001 - Studia Logica 68 (1):3-20.details
|
|
On the possibility of completing an infinite process.Charles S. Chihara - 1965 - Philosophical Review 74 (1):74-87.details
|
|
(12 other versions)Математизирането на историята: число и битие.Vasil Penchev - 2013 - Sofia: BAS: ISSk (IPR).details
|
|
Weaker variants of infinite time Turing machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.details
|
|
(1 other version)On TAE Machines and Their Computational Power.Apostolos Syropoulos - 2019 - Logica Universalis 13 (2):165-170.details
|
|
Royce's Model of the Absolute.Eric Steinhart - 2012 - Transactions of the Charles S. Peirce Society 48 (3):356-384.details
|
|
Cofinally Invariant Sequences and Revision.Edoardo Rivello - 2015 - Studia Logica 103 (3):599-622.details
|
|
Effective Physical Processes and Active Information in Quantum Computing.Ignazio Licata - 2007 - Quantum Biosystems 1 (1):51-65.details
|
|
Information.Pieter Adriaans - 2012 - Stanford Encyclopedia of Philosophy.details
|
|
Infinite Time Decidable Equivalence Relation Theory.Samuel Coskey & Joel David Hamkins - 2011 - Notre Dame Journal of Formal Logic 52 (2):203-228.details
|
|
The many forms of hypercomputation.Toby Ord - 178 - Journal of Applied Mathematics and Computation 178:142-153.details
|
|
Synchronous Online Philosophy Courses: An Experiment in Progress.Fritz McDonald - 2018 - APA Newsletter on Philosophy and Computers 18 (1):37-40.details
|
|
The distribution of ITRM-recognizable reals.Merlin Carl - 2014 - Annals of Pure and Applied Logic 165 (9):1403-1417.details
|
|
The computational strengths of α-tape infinite time Turing machines.Benjamin Rin - 2014 - Annals of Pure and Applied Logic 165 (9):1501-1511.details
|
|
Beyond Physics? On the Prospects of Finding a Meaningful Oracle.Taner Edis & Maarten Boudry - 2014 - Foundations of Science 19 (4):403-422.details
|
|
Belief in the singularity is logically brittle.Selmer Bringsjord - 2012 - Journal of Consciousness Studies 19 (7-8):14.details
|
|
A Note on the Physical Possibility of Transfinite Computation.Wayne Aitken & Jeffrey A. Barrett - 2010 - British Journal for the Philosophy of Science 61 (4):867-874.details
|
|
Logically possible machines.Eric Steinhart - 2002 - Minds and Machines 12 (2):259-280.details
|
|
(3 other versions)Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.details
|
|
¿Existen las Máquinas Aceleradas de Turing? Paradojas y posibilidades lógicas.Jose Alejandro Fernández Cuesta - 2023 - Techno Review. International Technology, Science and Society Review 13 (1):49.74.details
|
|
Taming Koepke's Zoo II: Register machines.Merlin Carl - 2022 - Annals of Pure and Applied Logic 173 (3):103041.details
|
|
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.details
|
|
On the possibility, or otherwise, of hypercomputation.Philip D. Welch - 2004 - British Journal for the Philosophy of Science 55 (4):739-746.details
|
|
On the classification of vertex-transitive structures.John Clemens, Samuel Coskey & Stephanie Potter - 2019 - Archive for Mathematical Logic 58 (5-6):565-574.details
|
|
Human-Effective Computability†.Marianna Antonutti Marfori & Leon Horsten - 2018 - Philosophia Mathematica 27 (1):61-87.details
|
|
Hypercomputation and the Physical Church‐Turing Thesis.Paolo Cotogno - 2003 - British Journal for the Philosophy of Science 54 (2):181-223.details
|
|
Some observations on truth hierarchies.P. D. Welch - 2014 - Review of Symbolic Logic 7 (1):1-30.details
|
|
P^f NP^f for almost all f.J. D. Hamkins - 2003 - Mathematical Logic Quarterly 49 (5):536.details
|
|
Ultimate truth vis- à- vis stable truth.P. D. Welch - 2008 - Review of Symbolic Logic 1 (1):126-142.details
|
|
(1 other version)An argument for P=NP.Selmer Bringsjord - manuscriptdetails
|
|
Infinite time extensions of Kleene’s $${\mathcal{O}}$$.Ansten Mørch Klev - 2009 - Archive for Mathematical Logic 48 (7):691-703.details
|
|
Rethinking Revision.P. D. Welch - 2019 - Journal of Philosophical Logic 48 (1):137-154.details
|
|
Is there a nonrecursive decidable equational theory?Benjamin Wells - 2002 - Minds and Machines 12 (2):301-324.details
|
|
Register computations on ordinals.Peter Koepke & Ryan Siders - 2008 - Archive for Mathematical Logic 47 (6):529-548.details
|
|
Computable Diagonalizations and Turing’s Cardinality Paradox.Dale Jacquette - 2014 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 45 (2):239-262.details
|
|
Super turing-machines.B. Jack Copeland - 1998 - Complexity 4 (1):30-32.details
|
|
The classification of countable models of set theory.John Clemens, Samuel Coskey & Samuel Dworetzky - 2020 - Mathematical Logic Quarterly 66 (2):182-189.details
|
|
The basic theory of infinite time register machines.Merlin Carl, Tim Fischbach, Peter Koepke, Russell Miller, Miriam Nasfi & Gregor Weckbecker - 2010 - Archive for Mathematical Logic 49 (2):249-273.details
|
|
(1 other version)An Argument for P = NP.Selmer Bringsjord - 2017 - Minds and Machines 27 (4):663-672.details
|
|
2006 Annual Meeting of the Association for Symbolic Logic.Matthew Valeriote - 2007 - Bulletin of Symbolic Logic 13 (1):120-145.details
|
|
Discrete transfinite computation models.Philip D. Welch - 2011 - In S. B. Cooper & Andrea Sorbi (eds.), Computability in Context: Computation and Logic in the Real World. World Scientific. pp. 375--414.details
|
|