On the relationship between deterministic time and deterministic reversal

DOI10.1016/0020-0190(93)90016-3MaRDI QIDQ1209341zbMATH OpenOpenAlexFDO

Authors Maciej Liśkiewicz

Publication date 16 May 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(93)90016-3

zbMATH Keywords

computational complexitytime complexitydeterministic Turing machines

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites work

• On Time Versus Space
• Reversal Complexity
• Tape-reversal bounded Turing machine computations
• The difference between one tape and two tapes: With respect to reversal complexity
• The reduction of tape reversals for off-line one-tape Turing machines

Cited in

(3)

• Relational analysis of the Frauchiger-Renner paradox and interaction-free detection of records from the past
• Reversal complexity revisited
• Reversible space equals deterministic space

This page was built for publication: On the relationship between deterministic time and deterministic reversal

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