Alternating Turing machines for inductive languages

From MaRDI portal

Publication:2850842

Jump to:navigation, search

DOI10.2168/LMCS-9(3:29)2013zbMath1322.03030arXiv1309.5544OpenAlexW1970516401MaRDI QIDQ2850842

Daniel Leivant

Publication date: 1 October 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

polynomial-time hierarchy arithmetical hierarchy alternating Turing machine hyper-elementary language inductive language

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Inductive definability (03D70)

This page was built for publication: Alternating Turing machines for inductive languages

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