Skip to main content
×
×
Home
  • Print publication year: 2013
  • Online publication date: December 2013

Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals

Recommend this book

Email your librarian or administrator to recommend adding this book to your organisation's collection.

Effective Mathematics of the Uncountable
  • Online ISBN: 9781139028592
  • Book DOI: https://doi.org/10.1017/CBO9781139028592
Please enter your name
Please enter a valid email address
Who would you like to send this to *
×
[1] Merlin, Carl, Tim, Fischbach, Peter, Koepke, Russell, Miller, Miriam, Nasfi, and Gregor, Weckbecker. The basic theory of infinite time register machines. Archive for Mathematical Logic, 49(2): 249–273, 2010.
[2] Sam, Coskey and Joel David, Hamkins. Infinite time computable equivalence relations. Notre Dame Journal of Formal Logic, 52(2): 203–228, 2011.
[3] Vinay, Deolalikar, Joel David, Hamkins, and Ralf-Dieter, Schindler. P ≠ NP ∩ co – NP for infinite time Turing machines. Journal of Logic and Computation, 15(5): 577–592, 2005.
[4] Harvey, Friedman and Lee, Stanley. A Borel reducibility theory for classes of countable structures. J. Symbolic Logic, 54(3): 894–914, 1989.
[5] Joel David, Hamkins. Infinite time Turing machines. Minds and Machines, 12(4): 521–539, 2002. (special issue devoted to hypercomputation).
[6] Joel David, Hamkins. Supertask computation. In Boris, PiwingerBenedikt, Löwe and Thoralf, Räsch, editors, Classical and New Paradigms ofComputation and their Complexity Hierarchies, Papers of the conference “Foundations of the Formal Sciences III” held in Vienna, September 21–24, 2001. Volume 23 of Trends in Logic, pages 141–158. Kluwer Academic Publishers, 2004.
[7] Joel David, Hamkins. Infinitary computability with infinite time Turing machines. In Barry S., Cooper and Benedikt, Löwe, editors, New Computational Paradigms, CiE, Amsterdam, June 8–12 2005. Volume 3526 of Lecture Notes in Computer Science, Springer, 2005.
[8] Joel David, Hamkins. A survey of infinite time Turing machines. In Jérôme, Durand-Lose and Maurice, Margenstern, editors, Machines, Computations, and Universality – 5th International Conference MCU 2007, Orleans, France. Volume 4664 of Lecture Notes in Computer Science, Springer, 2007.
[9] Joel David, Hamkins and Andy, Lewis. Infinite time Turing machines. J. Symbolic Logic, 65(2): 567–604, 2000.
[10] Joel David, Hamkins and Andy, Lewis. Post's problem for supertasks has both positive and negative solutions. Archive for Mathematical Logic, 41(6): 507–523, 2002.
[11] Joel David, Hamkins, David, Linetsky, and Russell, Miller. The complexity of quickly decidable ORM-decidable sets. In Barry, Cooper, Benedikt, Löwe, and Andrea, Sorbi, editors, Computation and Logic in the Real World – Third Conference of Computability in Europe CiE 2007, Siena, Italy. Volume 4497 of Lecture Notes in Computer Science, Springer, 2007.
[12] Joel David, Hamkins and Russell, Miller. Post's problem for ordinal register machines. In Barry, Cooper, Benedikt, Löwe, and Andrea, Sorbi, editors, Computation and Logic in the Real World – Third Conference ofCom-putability in Europe CiE 2007, Siena, Italy. Volume 4497 of Lecture Notes in Computer Science, Springer, 2007.
[13] Joel David, Hamkins and Russell, Miller. Post's problem for ordinal register machines: an explicit approach. Annals of Pure and Applied Logic, 160(3): 302–309, 2009.
[14] J. D., Hamkins, R., Miller, D., Seabold, and S., Warner. Infinite time computable model theory. In S.B., Cooper, Benedikt, Löwe, and Andrea, Sorbi, editors, New Computational Paradigms: Changing Conceptions of What is Computable, pages 521–557. Springer, 2007.
[15] Joel David, Hamkins and Daniel, Seabold. Infinite time Turing machines with only one tape. Mathematical Logic Quarterly, 47(2): 271–287, 2001.
[16] Joel David, Hamkins and Philip, Welch. Pf ≠ NPf for almost all f. Mathematical Logic Quarterly, 49(5): 536–540, 2003.
[17] Greg, Hjorth. Classification and Orbit Equivalence Relations, volume 75 of Mathematical Surveys and Monographs. American Mathematical Society, Providence, 2000.
[18] Greg, Hjorth and Alexander S., Kechris. Borel equivalence relations and classifications of countable models. Ann. Pure Appl. Logic, 82(3): 221–272, 1996.
[19] Peter, Koepke and Martin, Koerwien. Ordinal computations. Math. Structures Comput. Sci., 16(5): 867–884, 2006.
[20] Peter, Koepke. Turing computations on ordinals. Bulletin of Symbolic Logic, 11(3): 377–397, 2005.
[21] Peter, Koepke and Ryan, Siders. Register computations on ordinals. Archive for Mathematical Logic, 47(6): 529–548, 2008.
[22] Peter, Koepke and Benjamin, Seyfferth. Ordinal machines and admissible recursion theory. Ann. Pure Appl. Logic, 160(3): 310–318, 2009.
[23] Benedikt, Löwe. Revision sequences and computers with an infinite amount of time. Logic Comput., 11(1): 25–40, 2001.
[24] Benedikt, Löwe. Space bounds for infinitary computation. In Arnold, Beckmann, Ulrich, Berger, Benedikt, Löwe, and John V., Tucker, editors, Logical Approaches to Computations Barriers: Second Conference on Computabil-ity in Europe. Volume 3988 of Lecture Notes in Computer Science, pages 319–329. Springer, 2006.
[25] Giacomo, Lenzi and Erich, Monteleone. On fixpoint arithmetic and infinite time Turing machines. Information Processing Letters, 91(3): 121–128, 2004.
[26] Ralf-Dieter, Schindler. P ≠ NP for infinite time Turing machines. Monatshefte fur Mathematik, 139(4): 335–340, 2003.
[27] Scott, Schneider and Simon, Thomas. Countable Borel equivalence relations. In: James, Cummings and Ernest, Schimmerling, editors, Appalachian Set Theory 2006–2012. Volume 402 of LMS Lecture Note Series, pages 25–62, Cambridge University Press, 2012.
[28] Philip, Welch. Friedman's trick: Minimality arguments in the infinite time Turing degrees. In S.B., Cooper and J.K., Truss, editors, Sets and Proofs, Proceedings ASL Logic Colloquium, Volume 258 of LMS Lecture Note Series, pages 425–436, Cambridge University Press, 1999.
[29] Philip, Welch. Eventually infinite time Turing machine degrees: Infinite time decidable reals. Journal of Symbolic Logic, 65(3): 1193–1203, 2000.
[30] Philip, Welch. The lengths of infinite time Turing machine computations. Bulletin of the London Mathematical Society, 32(2): 129–136, 2000.
[31] Philip, Welch. The transfinite action of 1 tape Turing machines. In Barry S., Cooper and Benedikt, Löwe, editors, New Computational Paradigms, CiE, Amsterdam, June 8–12 2005. Volume 3526 of Lecture Notes in Computer Science, Springer, 2005.
[32] Philip D., Welch. Bounding lemmata for non-deterministic halting times of transfinite Turing machines. Theoret. Comput. Sci., 394(3): 223–228, 2008.