1983•Theoretical Computer ScienceRequires access
A Turing machine time hierarchy
Stanislav Žák
Open publisher page 152 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Stanislav Žák
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 152 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Turing machine, Time hierarchy theorem, Universal Turing machine, Nondeterministic algorithm, Computer science, Complexity class, Alphabet, Description number