A Hierarchy of Fast Reversible Turing Machines (Q2822488): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-20860-2_2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1134399418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time Complexity of Tape Reduction for Reversible Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time/Space Trade-Offs for Reversible Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-tape, off-line Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible Turing Machines and Polynomial Time Reversibly Computable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Turing machines in the range between real-time and linear-time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible space equals deterministic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3763607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Definable Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5599173 / rank
 
Normal rank

Latest revision as of 15:09, 12 July 2024

scientific article
Language Label Description Also known as
English
A Hierarchy of Fast Reversible Turing Machines
scientific article

    Statements

    A Hierarchy of Fast Reversible Turing Machines (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 September 2016
    0 references
    reversible Turing machines
    0 references
    structural computational complexity
    0 references
    time hierarchies
    0 references
    fast computations
    0 references
    real time vs. linear time
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references