Pages that link to "Item:Q5559248"

The following pages link to The undecidability of the Turing machine immortality problem (Q5559248):

Displaying 33 items.

• A small minimal aperiodic reversible Turing machine (Q340590) (← links)
• The periodic domino problem revisited (Q410732) (← links)
• Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines (Q596050) (← links)
• Some undecidable termination problems for semi-Thue systems (Q673625) (← links)
• The immortality problem for Lag systems (Q918728) (← links)
• On deciding stability of multiclass queueing networks under buffer priority scheduling policies (Q983890) (← links)
• Complexity of certain decision problems about congruential languages (Q1085618) (← links)
• The finite power property for context-free languages (Q1157912) (← links)
• Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
• Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
• Simple termination is difficult (Q1343111) (← links)
• Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
• On the presence of periodic configurations in Turing machines and in counter machines. (Q1853547) (← links)
• Automatic graphs and D0L-sequences of finite graphs (Q1877692) (← links)
• Undecidability of the speed positiveness problem in reversible and complete Turing machines (Q2040026) (← links)
• On the domino problem of the Baumslag-Solitar groups (Q2243576) (← links)
• The stability of the deterministic Skorokhod problem is undecidable (Q2339927) (← links)
• Lower bounds for runtime complexity of term rewriting (Q2398176) (← links)
• A decision procedure using discrete geometry (Q2560235) (← links)
• Topological mixing notions on Turing machine dynamical systems (Q2672276) (← links)
• Periodicity and Immortality in Reversible Computing (Q3599146) (← links)
• Diem-Grade Logischer Entscheidungsprobleme (Q4135479) (← links)
• About the Domino Problem for Subshifts on Groups (Q4613553) (← links)
• Simple termination is difficult (Q5055798) (← links)
• The Undecidability of the Domino Problem (Q5141335) (← links)
• On the Undecidability of the Tiling Problem (Q5448639) (← links)
• A survey of computational complexity results in systems and control (Q5926262) (← links)
• Deciding stability and mortality of piecewise affine dynamical systems (Q5941097) (← links)
• The stability of saturated linear dynamical systems is undecidable (Q5943100) (← links)
• On relations between properties in transitive Turing machines (Q6058472) (← links)
• Positive First-order Logic on Words and Graphs (Q6135776) (← links)
• Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) (Q6137845) (← links)
• Homotopy theory of monoid actions via group actions and an Elmendorf style theorem (Q6181395) (← links)