Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Welch, P.D.
2000.
Eventually infinite time Turing machine degrees: infinite time decidable reals.
Journal of Symbolic Logic,
Vol. 65,
Issue. 3,
p.
1193.
Lafitte, Grégory
2001.
Fundamentals of Computation Theory.
Vol. 2138,
Issue. ,
p.
252.
Cotogno, Paolo
2003.
Hypercomputation and the Physical Church‐Turing Thesis.
The British Journal for the Philosophy of Science,
Vol. 54,
Issue. 2,
p.
181.
Hamkins, Joel David
and
Welch, Philip D.
2003.
Pf ≠ NPf for almost all f.
Mathematical Logic Quarterly,
Vol. 49,
Issue. 5,
p.
536.
Welch, P. D.
2004.
On the Possibility, or Otherwise, of Hypercomputation.
The British Journal for the Philosophy of Science,
Vol. 55,
Issue. 4,
p.
739.
Hamkins, Joel David
2005.
New Computational Paradigms.
Vol. 3526,
Issue. ,
p.
180.
Welch, Philip D.
2005.
New Computational Paradigms.
Vol. 3526,
Issue. ,
p.
532.
Löwe, Benedikt
2006.
Logical Approaches to Computational Barriers.
Vol. 3988,
Issue. ,
p.
319.
Welch, P. D.
2006.
Logical Approaches to Computational Barriers.
Vol. 3988,
Issue. ,
p.
571.
Hamkins, Joel David
2007.
Machines, Computations, and Universality.
Vol. 4664,
Issue. ,
p.
62.
Hamkins, Joel D.
and
Miller, Russell G.
2007.
Computation and Logic in the Real World.
Vol. 4497,
Issue. ,
p.
358.
Welch, Philip D.
2007.
Computation and Logic in the Real World.
Vol. 4497,
Issue. ,
p.
768.
Welch, Philip D.
2008.
Bounding lemmata for non-deterministic halting times of transfinite Turing machines.
Theoretical Computer Science,
Vol. 394,
Issue. 3,
p.
223.
Hamkins, Joel David
Miller, Russell
Seabold, Daniel
and
Warner, Steve
2008.
New Computational Paradigms.
p.
521.
Klev, Ansten Mørch
2009.
Infinite time extensions of Kleene’s $${\mathcal{O}}$$.
Archive for Mathematical Logic,
Vol. 48,
Issue. 7,
p.
691.
Hamkins, Joel David
and
Miller, Russell G.
2009.
Post’s Problem for ordinal register machines: An explicit approach.
Annals of Pure and Applied Logic,
Vol. 160,
Issue. 3,
p.
302.
Welch, P.D.
2009.
Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and Normal Form theorems.
Theoretical Computer Science,
Vol. 410,
Issue. 4-5,
p.
426.
Coskey, Samuel
and
Hamkins, Joel David
2011.
Infinite Time Decidable Equivalence Relation Theory.
Notre Dame Journal of Formal Logic,
Vol. 52,
Issue. 2,
P. D. Welch
2011.
Weak systems of determinacy and arithmetical quasi-inductive definitions.
The Journal of Symbolic Logic,
Vol. 76,
Issue. 2,
p.
418.
Welch, P. D.
2011.
Determinacy in strong cardinal models.
The Journal of Symbolic Logic,
Vol. 76,
Issue. 2,
p.
719.