Decision Times of Infinite Computations-Reference-Cited by-同舟云学术

Decision Times of Infinite Computations

Published:2022-05-01 Issue:2 Volume:63 Page:
ISSN:0029-4527
Container-title:Notre Dame Journal of Formal Logic
language:
Short-container-title:Notre Dame J. Formal Logic

Author:

Carl Merlin¹,Schlicht Philipp²,Welch Philip³

Affiliation:

1. Europa-Universität Flensburg, Institut für mathematische, naturwissenschaftliche und technische Bildung, Abteilung für Mathmematik und ihre Didaktik, Flensburg, Germany

2. School of Mathematics, University of Bristol, Bristol, United Kingdom, and Institute for Mathematics, University of Vienna, Vienna, Austria

3. School of Mathematics, University of Bristol, Bristol, United Kingdom

Publisher

Duke University Press

Subject

Logic

Reference22 articles.

1. Barwise, K. J., Admissible Sets and Structures, Springer, Berlin, 1975.

2. Carl, M., Ordinal Computability: An Introduction to Infinitary Machines, vol. 9 of Logic and Its Applications, De Gruyter, Berlin, 2019.

3. Carl, M. “Space and time complexity for infinite time Turing machines,” Journal of Logic and Computation, vol. 30 (2020), pp. 1239–55.

4. Carl, M., P. Schlicht, and P. D. Welch, “Countable ranks at the first and second projective levels,” in preparation, 2022.

5. Friedman, S.-D., and P. D. Welch, “Two observations regarding infinite time Turing machines,” pp. 44–48 in Bonn International Workshop on Ordinal Computability, 2007, http://www.math.uni-bonn.de/ag/logik/events/biwoc/report.pdf

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lower bounds on β ( α ) and other properties of α-register machines;Computability;2024-03-06