Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Lafitte, Grégory
2001.
Fundamentals of Computation Theory.
Vol. 2138,
Issue. ,
p.
252.
Visser, Albert
2002.
Handbook of Philosophical Logic.
p.
149.
Steinhart, Eric
2002.
Logically Possible Machines.
Minds and Machines,
Vol. 12,
Issue. 2,
p.
259.
Wiedermann, Jiří
and
van Leeuwen, Jan
2002.
Unconventional Models of Computation.
Vol. 2509,
Issue. ,
p.
287.
Hamkins, Joel David
2002.
Infinite Time Turing Machines.
Minds and Machines,
Vol. 12,
Issue. 4,
p.
521.
Copeland, B. Jack
2002.
Unconventional Models of Computation.
Vol. 2509,
Issue. ,
p.
15.
Etesi, Gábor
and
Németi, István
2002.
Non-Turing Computations Via Malament–Hogarth Space-Times.
International Journal of Theoretical Physics,
Vol. 41,
Issue. 2,
p.
341.
Wells, Benjamin
2002.
Is There a Nonrecursive Decidable Equational Theory?.
Minds and Machines,
Vol. 12,
Issue. 2,
p.
301.
Lafitte, Grégory
2002.
Foundations of Information Technology in the Era of Network and Mobile Computing.
p.
267.
Copeland, B. Jack
2002.
Accelerating Turing Machines.
Minds and Machines,
Vol. 12,
Issue. 2,
p.
281.
Cotogno, Paolo
2003.
Hypercomputation and the Physical Church‐Turing Thesis.
The British Journal for the Philosophy of Science,
Vol. 54,
Issue. 2,
p.
181.
Steinhart, Eric
2003.
Supermachines and Superminds.
Minds and Machines,
Vol. 13,
Issue. 1,
p.
155.
Hamkins, Joel David
and
Welch, Philip D.
2003.
Pf ≠ NPf for almost all f.
Mathematical Logic Quarterly,
Vol. 49,
Issue. 5,
p.
536.
Burgin, M.
2003.
Nonlinear phenomena in spaces of algorithms.
International Journal of Computer Mathematics,
Vol. 80,
Issue. 12,
p.
1449.
Namikawa, Jun
and
Hashimoto, Takashi
2004.
Dynamics and computation in functional shifts.
Nonlinearity,
Vol. 17,
Issue. 4,
p.
1317.
Wells, Benjamin
2004.
Hypercomputation by definition.
Theoretical Computer Science,
Vol. 317,
Issue. 1-3,
p.
191.
Bringsjord, Selmer
and
Arkoudas, Konstantine
2004.
The modal argument for hypercomputing minds.
Theoretical Computer Science,
Vol. 317,
Issue. 1-3,
p.
167.
Lenzi, Giacomo
and
Monteleone, Erich
2004.
On Fixpoint Arithmetic and Infinite Time Turing Machines.
Information Processing Letters,
Vol. 91,
Issue. 3,
p.
121.
Shagrir, Oron
2004.
Super-tasks, accelerating Turing machines and uncomputability.
Theoretical Computer Science,
Vol. 317,
Issue. 1-3,
p.
105.
Burgin, Mark
and
Klinger, Allen
2004.
Three aspects of super-recursive algorithms and hypercomputation or finding black swans.
Theoretical Computer Science,
Vol. 317,
Issue. 1-3,
p.
1.