On the Complexity of Undecidable Problems in Automata Theory

DOI10.1145/321495.321507MaRDI QIDQ5573397zbMATH OpenOpenAlexFDO

Authors J. Hartmanis

Publication date 1969

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321495.321507

zbMATH Keywords

recursion theory, constructive mathematics

Cited in

(2)

• Tape-reversal bounded Turing machine computations
• Complexity of algorithms and computations

This page was built for publication: On the Complexity of Undecidable Problems in Automata Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5573397)