Undecidability of the speed positiveness problem in reversible and complete Turing machines (Q2040026): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2021.04.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3163342729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On topological dynamics of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: One head machines from a symbolic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the presence of periodic configurations in Turing machines and in counter machines. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodicity and Immortality in Reversible Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A small minimal aperiodic reversible Turing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of the entropy of one-tape Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transitivity Problem of Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distortion in one-head machines and cellular automata / 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: The undecidability of the Turing machine immortality problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Immortal Configurations in Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of a reversible two-counter machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3108337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2711810 / rank
 
Normal rank

Latest revision as of 04:15, 26 July 2024

scientific article
Language Label Description Also known as
English
Undecidability of the speed positiveness problem in reversible and complete Turing machines
scientific article

    Statements

    Undecidability of the speed positiveness problem in reversible and complete Turing machines (English)
    0 references
    6 July 2021
    0 references
    Turing machine
    0 references
    maximum speed
    0 references
    blank tape halting problem
    0 references
    dynamical systems
    0 references

    Identifiers

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