Space and time complexity for infinite time Turing machines

DOI10.1093/LOGCOM/EXAA025OpenAlexW3033897917MaRDI QIDQ5140310

Merlin Carl

Publication date: 15 December 2020

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.06832

zbMATH Keywords

set theorytime complexityrecognizabilityspace complexityPSPACEordinal computabilityinfinite time Turing machineinfinite time register machine

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Related Items (1)

Decision times of infinite computations

This page was built for publication: Space and time complexity for infinite time Turing machines