New time hierarchy results for deterministic TMS

DOI10.1007/3-540-55210-3_194MaRDI QIDQ5096792zbMATH OpenOpenAlexFDO

Authors Krzysztof Loryś

Publication date 18 August 2022

Published in STACS 92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55210-3_194

zbMATH Keywords

deterministic Turing machines

Mathematics Subject Classification ID

Classical models of computation (Turing machines, etc.) (68Q04) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 4205978
• On the structure of one-tape nondeterministic Turing machine time hierarchy
• Determinism versus non-determinism for linear time RAMs (extended abstract)
• scientific article; zbMATH DE number 1222593
• On the determinization of timed systems
• Pseudodeterministic algorithms and the structure of probabilistic time
• The Descriptive Complexity of the Deterministic Exponential Time Hierarchy
• Publication:3476799
• Dimension- and time-hierarchies for small time bounds.
• New results on timed specifications

Cites work

• Computational Complexity of One-Tape Turing Machine Computations
• Data structures for distributed counting
• scientific article; zbMATH DE number 3407150 (Why is no real title available?)
• On alternation
• One-tape, off-line Turing machine computations
• Two-Tape Simulation of Multitape Turing Machines

Cited in

(5)

• scientific article; zbMATH DE number 4145886 (Why is no real title available?)
• scientific article; zbMATH DE number 1339956 (Why is no real title available?)
• A Turing machine distance hierarchy
• Dimension- and time-hierarchies for small time bounds.
• Data structures for distributed counting

This page was built for publication: New time hierarchy results for deterministic TMS

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