Tag systems and Collatz-like functions
From MaRDI portal
Publication:2474075
DOI10.1016/J.TCS.2007.10.020zbMATH Open1134.68024OpenAlexW2063470502MaRDI QIDQ2474075FDOQ2474075
Authors: Liesbeth De Mol
Publication date: 5 March 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://biblio.ugent.be/publication/436211
Recommendations
universalitytag systems\(3n+1\)-problemCollatz-like functionslimits of solvability and unsolvability
Cites Work
- Universality in elementary cellular automata
- Title not available (Why is that?)
- Formal Reductions of the General Combinatorial Decision Problem
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Busy beaver competition and Collatz-like problems
- Small universal Turing machines
- Title not available (Why is that?)
- The 3x + 1 Problem and Its Generalizations
- Frontier between decidability and undecidability: A survey
- Closing the Circle: An Analysis of Emil Post's Early Work
- P-completeness of Cellular Automaton Rule 110
- Small fast universal Turing machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tag systems and lag systems
- Study of Limits of Solvability in Tag Systems
- Title not available (Why is that?)
- Why Gödel didn't have church's thesis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solvability of the Halting and Reachability Problem for Binary 2-tag Systems
- Title not available (Why is that?)
- Four Small Universal Turing Machines
- Small Turing machines and generalized busy beaver competition
- Title not available (Why is that?)
- Small universal one-state linear operator algorithm
Cited In (9)
- Problems in number theory from busy beaver competition
- Study of Limits of Solvability in Tag Systems
- Title not available (Why is that?)
- The convergence classes of Collatz function
- On the complex behavior of simple tag systems -- an experimental approach
- An automated approach to the Collatz conjecture
- An automated approach to the Collatz conjecture
- Generalized tag systems
- On the boundaries of solvability and unsolvability in tag systems. Theoretical and experimental results
This page was built for publication: Tag systems and Collatz-like functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474075)