Effective Mathematics of the Uncountable

- Print publication year: 2013
- Online publication date: December 2013

- Publisher: Cambridge University Press
- DOI: https://doi.org/10.1017/CBO9781139028592.004
- pp 33-49

Powered by UNSILO

[1] The basic theory of infinite time register machines. Archive for Mathematical Logic, 49(2): 249–273, 2010. , , , , , and .

[2] Infinite time computable equivalence relations. Notre Dame Journal of Formal Logic, 52(2): 203–228, 2011. and .

[3] P ≠ NP ∩ co – NP for infinite time Turing machines. Journal of Logic and Computation, 15(5): 577–592, 2005. , , and .

[4] A Borel reducibility theory for classes of countable structures. J. Symbolic Logic, 54(3): 894–914, 1989. and .

[5] Infinite time Turing machines. Minds and Machines, 12(4): 521–539, 2002. (special issue devoted to hypercomputation). .

[6] 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. . Supertask computation. In and , editors,

[7] New Computational Paradigms, CiE, Amsterdam, June 8–12 2005. Volume 3526 of Lecture Notes in Computer Science, Springer, 2005. . Infinitary computability with infinite time Turing machines. In and , editors,

[8] Machines, Computations, and Universality – 5th International Conference MCU 2007, Orleans, France. Volume 4664 of Lecture Notes in Computer Science, Springer, 2007. . A survey of infinite time Turing machines. In and , editors,

[9] Infinite time Turing machines. J. Symbolic Logic, 65(2): 567–604, 2000. and .

[10] Post's problem for supertasks has both positive and negative solutions. Archive for Mathematical Logic, 41(6): 507–523, 2002. and .

[11] 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. , , and . The complexity of quickly decidable ORM-decidable sets. In , , and , editors,

[12] 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. and . Post's problem for ordinal register machines. In , , and , editors,

[13] Post's problem for ordinal register machines: an explicit approach. Annals of Pure and Applied Logic, 160(3): 302–309, 2009. and .

[14] New Computational Paradigms: Changing Conceptions of What is Computable, pages 521–557. Springer, 2007. , , , and . Infinite time computable model theory. In , , and , editors,

[15] Infinite time Turing machines with only one tape. Mathematical Logic Quarterly, 47(2): 271–287, 2001. and .

[16] Pf ≠ NPf for almost all f. Mathematical Logic Quarterly, 49(5): 536–540, 2003. and .

[17] Classification and Orbit Equivalence Relations, volume 75 of Mathematical Surveys and Monographs. American Mathematical Society, Providence, 2000. .

[18] Borel equivalence relations and classifications of countable models. Ann. Pure Appl. Logic, 82(3): 221–272, 1996. and .

[19] Ordinal computations. Math. Structures Comput. Sci., 16(5): 867–884, 2006. and .

[20] Turing computations on ordinals. Bulletin of Symbolic Logic, 11(3): 377–397, 2005. .

[21] Register computations on ordinals. Archive for Mathematical Logic, 47(6): 529–548, 2008. and .

[22] Ordinal machines and admissible recursion theory. Ann. Pure Appl. Logic, 160(3): 310–318, 2009. and .

[23] Revision sequences and computers with an infinite amount of time. Logic Comput., 11(1): 25–40, 2001. .

[24] 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. . Space bounds for infinitary computation. In , , , and , editors,

[25] On fixpoint arithmetic and infinite time Turing machines. Information Processing Letters, 91(3): 121–128, 2004. and .

[26] P ≠ NP for infinite time Turing machines. Monatshefte fur Mathematik, 139(4): 335–340, 2003. .

[27] Appalachian Set Theory 2006–2012. Volume 402 of LMS Lecture Note Series, pages 25–62, Cambridge University Press, 2012. and . Countable Borel equivalence relations. In: and , editors,

[28] Sets and Proofs, Proceedings ASL Logic Colloquium, Volume 258 of LMS Lecture Note Series, pages 425–436, Cambridge University Press, 1999. . Friedman's trick: Minimality arguments in the infinite time Turing degrees. In and , editors,

[29] Eventually infinite time Turing machine degrees: Infinite time decidable reals. Journal of Symbolic Logic, 65(3): 1193–1203, 2000. .

[30] The lengths of infinite time Turing machine computations. Bulletin of the London Mathematical Society, 32(2): 129–136, 2000. .

[31] New Computational Paradigms, CiE, Amsterdam, June 8–12 2005. Volume 3526 of Lecture Notes in Computer Science, Springer, 2005. . The transfinite action of 1 tape Turing machines. In and , editors,

[32] Bounding lemmata for non-deterministic halting times of transfinite Turing machines. Theoret. Comput. Sci., 394(3): 223–228, 2008. .