Linked bibliography for the SEP article "Supertasks" by JB Manchak and Bryan W. Roberts

This is an automatically generated and experimental page

If everything goes well, this page should display the bibliography of the aforementioned article as it appears in the Stanford Encyclopedia of Philosophy, but with links added to PhilPapers records and Google Scholar for your convenience. Some bibliographies are not going to be represented correctly or fully up to date. In general, bibliographies of recent works are going to be much better linked than bibliographies of primary literature and older works. Entries with PhilPapers records have links on their titles. A green link indicates that the item is available online at least partially.

This experiment has been authorized by the editors of the Stanford Encyclopedia of Philosophy. The original article and bibliography can be found here.

Andréka, H., Madarász, J., Németi, I., Németi, P. and G. Székely, 2018, “Relativistic Computation”, in M. Cuffaro and S. Fletcher (eds.), Physical Perspectives on Computation, Computational Perspectives on Physics, Cambridge: Cambridge University Press, 195–215. (Scholar)
Atkinson, D., 2007, “Losing energy in classical, relativistic and quantum mechanics”, Studies in History and Philosophy of Modern Physics, 38(1): 170–180. (Scholar)
–––, 2008, “A relativistic zeno effect. Synthese”, 160(1): 5–12. (Scholar)
Atkinson, D. and Johnson, P., 2009, “Nonconservation of energy and loss of determinism I. Infinitely many colliding balls”, Foundations of Physics, 39(8): 937–957. (Scholar)
–––, 2010, “Nonconservation of energy and loss of determinism II. Colliding with an open set”, Foundations of Physics, 40(2): 179–189. (Scholar)
Atkinson, D. and Peijnenburg, J., 2014, “How some infinities cause problems in classical physical theories”, In Allo, P. and Kerkhoeve, B. V., editors, Modestly radical or radically modest: Festschrift for Jean Paul Van Bendegem on the Occasion of his 60th Birthday, pages 1–10. London: College Publications. (Scholar)
Allis, V. and T. Koetsier, 1991, “On Some Paradoxes of the Infinite”, The British Journal for the Philosophy of Science, 42: 187–194. (Scholar)
–––, 1995, “On Some Paradoxes of the Infinite II”, The British Journal for the Philosophy of Science, 46: 235–247. (Scholar)
Barrett, J. A. and F. Arntzenius, 1999, “An infinite decision puzzle”, Theory and Decision, 46(1), 101–103. (Scholar)
–––, 2002, “Why the infinite decision puzzle is puzzling”, Theory and decision 52(2): 139–147. (Scholar)
Bashirov, A.E., 2014, Mathematical Analysis Fundamentals Waltham, MA: Elsevier. (Scholar)
Bell, J. S., 2004, Speakable and unspeakable in quantum mechanics: Collected papers on quantum philosophy. Cambridge: Cambridge University Press. (Scholar)
Benacerraf, P., 1962, “Tasks, Super-Tasks, and the Modern Eleatics”, The Journal of Philosophy, 59(24): 765–784. (Scholar)
Benardete, J. A., 1964, Infinity: An essay in metaphysics., Oxford: Oxford University Press. (Scholar)
Black, M., 1951, “Achilles and the Tortoise”, Analysis, 11(5): 91–101. (Scholar)
Blum, L., Cucker, F., Shub, M. and Smale, S., 1998, Complexity and real computation, New York: Springer-Verlag. (Scholar)
Bokulich, A., 2003, “Quantum measurements and supertasks”, International Studies in the Philosophy of Science, 17(2): 127–136. (Scholar)
Bub, J., 1988, “How to solve the measurement problem of quantum mechanics”, Foundations of Physics 18(7): 701–722. (Scholar)
Carl, M., Fischbach, T., Koepke, P., Miller, R., Nasfi, M. and Weckbecker, G., 2010, “The basic theory of infinite time register machines”, Archive for Mathematical Logic 49(2): 249–273. (Scholar)
Copeland, B. J., 2015, “The Church-Turing Thesis”, The Stanford Encyclopedia of Philosophy (Summer 2015 Edition), Edward N. Zalta (ed.), URL = <https://plato.stanford.edu/archives/sum2015/entries/church-turing/>. (Scholar)
Deolalikar, V., Hamkins, J.D. and Schindler, R., 2005, “P ≠ NP ∩ co-NP for infinite time Turing machines”, Journal of Logic and Computation, 15(5): 577–592. (Scholar)
Doboszewski, J., 2019, “Epistemic Holes and Determinism in Classical General Relativity”, The British Journal for the Philosophy of Science, 71: 1093–1111. doi:10.1093/bjps/axz011 (Scholar)
Dolev, Y., 2007, “Super-tasks and Temporal Continuity”, Iyyun: The Jerusalem Philosophical Quarterly, 56: 313–329.‎ (Scholar)
Duncan, A. and M. Niedermaier, 2013, “Temporal breakdown and Borel resummation in the complex Langevin method”, Annals of Physics, 329: 93–124. (Scholar)
Earman, J., 1986, A Primer On Determinism, Dordrecht, Holland: D. Reidel Publishing Company. (Scholar)
–––, 1995, Bangs, Crunches, Wimpers, and Shrieks. Oxford University Press. (Scholar)
Earman, J. and J. Norton, 1993, “Forever is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes”, Philosophy of Science, 60: 22–42. (Scholar)
–––, 1996, “Infinite Pains: the Trouble with Supertasks”, in A. Morton and S. Stich (eds), Benacerraf and His Critics, Oxford: Blackwell, 231–261. (Scholar)
Earman, J., Wüthrich, C., and J. Manchak, 2016, “Time Machines”, The Stanford Encyclopedia of Philosophy (Winter 2016 Edition), Edward N. Zalta (ed.), URL = <https://plato.stanford.edu/archives/win2016/entries/time-machine/>. (Scholar)
Etesi, G. and I. Németi, 2002, “Non-Turing Computations Via Malament-Hogarth Space-Times”, International Journal of Theoretical Physics, 41: 341–370. (Scholar)
Gamow, G., 1947, One Two Three… Infinity: Facts and Speculations of Science. Dover. (Scholar)
Ghiradi, G.C., C. Omero, T. Weber and A. Rimini, 1979, “Small-time behaviour of quantum nondecay probability and Zeno’s paradox in quantum mechanics”, Nuovo Cimento, 52(A): 421 (Scholar)
Grünbaum, A., 1969, “Can an Infinitude of Operations be performed in Finite Time?” British Journal for the Philosophy of Science, 20: 203–218. (Scholar)
Gwiazda, J., 2012, “A proof of the impossibility of completing infinitely many tasks”, Pacific Philosophical Quarterly, 93: 1–7.
Hamkins, J. D. and Lewis, A., 2000, “Infinite time Turing machines”, Journal of Symbolic Logic, 65(2): 567–604. (Scholar)
Hamkins, J. D. and Miller, R. G., 2009, “Post’s problem for ordinal register machines: an explicit approach”, Annals of Pure and Applied Logic, 160(3): 302–309. (Scholar)
Hamkins, J.D., Miller, R., Seabold, D., and Warner, S., 2008, “Infinite time computable model theory”, in New Computational Paradigms: Changing Conceptions of What is Computable, S. B. Cooper, B. Löwe, and A. Sorbi (Eds.), New York: Springer, pgs. 521–557. (Scholar)
Hamkins, J.D. and Welch, P.D., 2003, “\(P^f \ne NP^f\) for almost all \(f\)”, Mathematical Logic Quarterly, 49(5): 536–540.
Hepp, K., 1972, “Quantum theory of measurement and macroscopic observables”, Helvetica Physica Acta 45(2): 237–248. (Scholar)
Hogarth, M., 1992, “Does General Relativity Allow an Observer to View an Eternity in a Finite Time?” Foundations of Physics Letters, 5: 173–181. (Scholar)
Hogarth, M., 1994, “Non-Turing Computers and Non-Turing Computability”, PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association, 1: 126–138. (Scholar)
Immerman, N., 2016, “Computability and Complexity”, The Stanford Encyclopedia of Philosophy (Spring 2016 Edition), Edward N. Zalta (ed.), forthcoming URL = <https://plato.stanford.edu/archives/spr2016/entries/computability/>. (Scholar)
Koepke, P., 2005, “Turing computations on ordinals” Bulletin of Symbolic Logic, 11(3): 377–397. (Scholar)
–––, 2006, “Infinite Time Register Machines”, In Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, July 2006, Proceedings, A. Beckmann, U. Berger, B. Löwe, J. V. Tucker (Eds.), Berlin: Springer-Verlag, pgs. 257–266, Lecture Notes in Computer Science 3988. (Scholar)
–––, 2009, “Ordinal Computability”, In Mathematical Theory and Computational Practice. 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19–24, 2009. Proceedings, K. Ambos-Spies, B. Löwe, W. Merkle (Eds.), Heidelberg: Springer-Verlag, pgs. 280–289, Lecture Notes in Computer Science 5635. (Scholar)
Koepke, P. and Miller, R., 2008, “An enhanced theory of infinite time register machines”. In Logic and Theory of Algorithms. 4th Conference on Computability in Europe, CiE 2008 Athens, Greece, June 15–20, 2008, Proceedings, Beckmann, A., Dimitracopoulos, C. and Löwe, B. (Eds.), Berlin: Springer, pgs. 306–315, Lecture Notes in Computer Science 5028. (Scholar)
Koepke, P. and Seyfferth, B., 2009, “Ordinal machines and admissible recursion theory”, Annals of Pure and Applied Logic, 160(3): 310–318. (Scholar)
Kremer, P., 2015, “The Revision Theory of Truth”, The Stanford Encyclopedia of Philosophy (Summer 2015 Edition), Edward N. Zalta (ed.), URL = <https://plato.stanford.edu/archives/sum2015/entries/truth-revision/>. (Scholar)
Kühnberger, K.-U., Löwe, B., Möllerfeld, M. and Welch, P.D., 2005, “Comparing inductive and circular definitions: parameters, complexities and games”, Studia Logica, 81: 79–98. (Scholar)
Landsman, N. P., 1991, “Algebraic theory of superselection sectors and the measurement problem in quantum mechanics”, International Journal of Modern Physics A 6(30): 5349–5371. (Scholar)
–––, 1995, “Observation and superselection in quantum mechanics”, Studies in History and Philosophy of Modern Physics, 26(1): 45–73. (Scholar)
Lanford, O. E. (1975) “Time Evolution of Large Classical Systems”, in Dynamical systems, theory and applications, J. Moser (Ed.), Springer Berlin Heidelberg, pgs. 1–111. (Scholar)
Littlewood, J. E., 1953, A Mathematician’s Miscellany, London: Methuen & Co. Ltd. (Scholar)
Löwe, B., 2001, “Revision sequences and computers with an infinite amount of time”, Journal of Logic and Computation, 11: 25–40. (Scholar)
–––, 2006, “Space bounds for infinitary computation”, in Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, July 2006, Proceedings, A. Beckmann, U. Berger, B. Löwe, J. V. Tucker (eds.), Berlin: Springer-Verlag, pgs. 319–329, Lecture Notes in Computer Science 3988. (Scholar)
Löwe, B. and Welch, P. D., 2001, “Set-Theoretic Absoluteness and the Revision Theory of Truth”, Studia Logica, 68: 21–41. (Scholar)
Mather, J. N. and R. McGehee, 1975, “Solutions of the Collinear Four-Body Problem Which Become Unbounded in a Finite Time”, in Dynamical systems, theory and applications, J. Moser (Ed.), Springer Berlin Heidelberg, pgs. 573–597. (Scholar)
Misra, B., and E. C. G. Sudarshan, 1977, “The Zeno’s paradox in quantum theory”, Journal of Mathematical Physics, 18(4): 756–763. (Scholar)
Malament, D., 1985, “Minimal Acceleration Requirements for ”Time Travel“ in Gödel Space-Time”, Journal of Mathematical Physics, 26: 774–777. (Scholar)
–––, 2008, “Norton’s Slippery Slope”, Philosophy of Science, 75: 799–816. (Scholar)
Manchak, J., 2009, “Is Spacetime Hole-Free?” General Relativity and Gravitation, 41: 1639–1643. (Scholar)
–––, 2010, “On the Possibility of Supertasks in General Relativity”, Foundations of Physics, 40: 276–288. (Scholar)
–––, 2018, “Malament-Hogarth Machines”, The British Journal for the Philosophy of Science, 71: 1143–1153. doi:10.1093/bjps/axy023 (Scholar)
Mclaughlin, William I., 1998, “Thomson’s lamp is dysfunctional”, Synthese, 116: 281–301. (Scholar)
Norton, J. D., 1999, “A Quantum Mechanical Supertask”, Foundations of Physics, 29(8): 1265–1302. (Scholar)
Penrose, R., 1979, “Singularities and Time-Asymmetry”, in S. Hawking and W. Israel (eds.), General Relativity: And Einstein Centenary Survey, Cambridge: Cambridge University Press, 581–638. (Scholar)
Pati, A. K., 1996, “Limit on the frequency of measurements in the quantum Zeno effect”, Physics Letters A 215(1–2): 7–13. (Scholar)
Peijnenburg, J. and Atkinson, D., 2008, “Achilles, the tortoise, and colliding balls”, History of Philosophy Quarterly, 25(3): 187–201. (Scholar)
Pérez Laraudogoita, J., 1996, “A beautiful supertask”, Mind, 105(417): 81–83.
–––, 1997, “Classical particle dynamics, indeterminism and a supertask”, The British Journal for the Philosophy of Science, 48(1): 49–54. (Scholar)
–––, 1998, “Infinity Machines and Creation Ex Nihilo”, Synthese, 115(2): 259–265. (Scholar)
–––, 1999, “Earman and Norton on Supertasks that Generate Indeterminism”, The British Journal for the Philosophy of Science, 50: 137–141. (Scholar)
Pérez Laraudogoita, J., M. Bridger and J. S. Alper, 2002, “Two Ways Of Looking At A Newtonian Supertask”, Synthese, 131(2): 173–189 (Scholar)
Pitowsky, I., 1990, “The Physical Church Thesis and Physical Computational Complexity”, Iyyun, 39: 81–99. (Scholar)
Rin, B., 2014, “The Computational Strengths of α-tape Infinite Time Turing Machines”, Annals of Pure and Applied Logic, 165(9): 1501–1511. (Scholar)
Ross, S. E., 1976, A First Course in Probability, Macmillan Publishing Co. Inc. (Scholar)
Sacks, G. E., 1990, Higher recursion theory, Heidelberg: Springer-Verlag, Perspectives in mathematical logic. (Scholar)
Salmon, W., 1998, “A Contemporary Look at Zeno’s Paradoxes: An Excerpt from Space, Time and Motion”, in Metaphysics: The Big Questions, van Inwagen and Zimmerman (Eds.), Malden, MA: Blackwell Publishers Ltd. (Scholar)
Schindler, R., 2003, “P ≠ NP for infinite time Turing machines”, Monatshefte der Mathematik 139(4): 335–340. (Scholar)
Smeenk, C. and C. Wüthrich, 2011, “Time Travel and Time Machines”, in C. Callender (ed.), The Oxford Handbook of Philosophy of Time, Oxford: Oxford University Press, 577–630. (Scholar)
Thomson, J. F., 1954, “Tasks and super-tasks”, Analysis, 15(1): 1–13. (Scholar)
Uzquiano, G., 2011, “Before-Effect without Zeno-Causality” Noûs, 46(2): 259–264. (Scholar)
Van Bendegem, J. P., 1994, “Ross’ Paradox Is an Impossible Super-Task”, The British Journal for the Philosophy of Science, 45(2): 743–748. (Scholar)
Wan, K-K., 1980, “Superselection rules, quantum measurement, and the Schrödinger’s cat”, Canadian Journal of Physics, 58(7): 976–982. (Scholar)
Welch, P. D. 2001, “On Gupta-Belnap revision theories of truth, Kripkean fixed points, and the Next stable set”, Bulletin for Symbolic Logic, 7: 345–360. (Scholar)
–––, 2008, “The extent of computation in Malament-Hogarth spacetimes”, British Journal for the Philosophy of Science, 59(4): 659–674. (Scholar)
Weyl, H., 1949, Philosophy of Mathematics and Natural Science, Princeton: Princeton University Press. (Scholar)
Winter, J., 2009, “Is \(\mathbf{P} = \mathbf{PSPACE}\) for Infinite Time Turing Machines?”, in Infinity in logic and computation. Revised selected papers from the International Conference (ILC 2007) held at the University of Cape Town (UCT), Cape Town, November 3–5, 2007. M. Archibald, V. Brattka, V. Goranko and B. Löwe (Eds.), Berlin: Springer-Verlag, pgs. 126–137. Lecture Notes in Computer Science 5489. (Scholar)

Generated Mon Mar 17 11:20:50 2025

Applied ethics	Epistemology	History of Western Philosophy	Meta-ethics	Metaphysics	Normative ethics
Philosophy of biology	Philosophy of language	Philosophy of mind	Philosophy of religion	Science Logic and Mathematics	More ...