Merlin Carl, Philipp Schlicht. The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters. In Jarkko Kari, Florin Manea, Ion Petre, editors, Unveiling Dynamics and Complexity - 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings. Volume 10307 of Lecture Notes in Computer Science, pages 198-209, Springer, 2017. [doi]
@inproceedings{CarlS17-0,
title = {The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters},
author = {Merlin Carl and Philipp Schlicht},
year = {2017},
doi = {10.1007/978-3-319-58741-7_20},
url = {https://doi.org/10.1007/978-3-319-58741-7_20},
researchr = {https://researchr.org/publication/CarlS17-0},
cites = {0},
citedby = {0},
pages = {198-209},
booktitle = {Unveiling Dynamics and Complexity - 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings},
editor = {Jarkko Kari and Florin Manea and Ion Petre},
volume = {10307},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-58741-7},
}