Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
On the Complexity of Undecidable Problems in Automata Theory - MaRDI portal

On the Complexity of Undecidable Problems in Automata Theory

From MaRDI portal

Publication:5573397

Jump to:navigation, search

DOI10.1145/321495.321507zbMath0182.02403OpenAlexW2075515413MaRDI QIDQ5573397

Juris 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

Related Items (2)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5573397&oldid=30198383"