An automated approach to the Collatz conjecture
From MaRDI portal
(Redirected from Publication:6103589)
An automated approach to the Collatz conjecture (scientific article; zbMATH DE number 7702721)
An automated approach to the Collatz conjecture (scientific article; zbMATH DE number 7702721)
Recommendations
- An automated approach to the Collatz conjecture
- A new approach on proving Collatz conjecture
- On the Collatz conjecture
- scientific article; zbMATH DE number 5263433
- Collatz conjecture revisited: an elementary generalization
- The Collatz problem and analogues
- An Approach to the Herzog-Schönheim Conjecture Using Automata
- About the Collatz conjecture
- Novel theorems and algorithms relating to the Collatz conjecture
Cites work
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- An automated approach to the Collatz conjecture
- An unsolved problem on the powers of 3/2
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- ARITHMETIC IN THE FORM
- Cellular Automata, the Collatz Conjecture and Powers of 3/2
- Compiling finite linear CSP into SAT
- Formal Reductions of the General Combinatorial Decision Problem
- Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs
- GRASP: a search algorithm for propositional satisfiability
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- scientific article; zbMATH DE number 3526785 (Why is no real title available?)
- scientific article; zbMATH DE number 2182446 (Why is no real title available?)
- scientific article; zbMATH DE number 789389 (Why is no real title available?)
- scientific article; zbMATH DE number 2236594 (Why is no real title available?)
- Imitation of an Iteration
- Improved matrix interpretation
- Local termination: theory and practice
- Lower bounds for the total stopping time of 3𝑥+1 iterates
- Matrix interpretations for proving termination of term rewriting
- Max/Plus tree automata for termination of term rewriting
- Mechanizing and improving dependency pairs
- Noncommutative rational series with applications
- On non-computable functions
- On some Markov matrices arising from the generalized Collatz mapping
- Positive rational sequences
- Problems in number theory from busy beaver competition
- Revisiting matrix interpretations for proving termination of term rewriting
- Small universal one-state linear operator algorithm
- Some Unconventional Problems in Number Theory
- Tag systems and Collatz-like functions
- Term Rewriting and All That
- Termination of cycle rewriting by transformation and matrix interpretation
- Termination of string rewriting proved automatically
- Termination of String Rewriting with Matrix Interpretations
- Termination of term rewriting using dependency pairs
- Termination of term rewriting: Interpretation and type elimination
- Termination proofs and the length of derivations
- The 3x + 1 Problem and Its Generalizations
- The Collatz problem
- The ultimate challenge. The \(3x+1\) problem
- The Undecidability of the Generalized Collatz Problem
- Wildness of iteration of certain residue-class-wise affine mappings
Cited in
(5)- An automated approach to the Collatz conjecture
- Cellular Automata, the Collatz Conjecture and Powers of 3/2
- Notes on Gödel's and Scott's variants of the ontological argument
- Chronological verification of the Collatz conjecture using theoretically proven sieves
- The relative strength of \#SAT proof systems
This page was built for publication: An automated approach to the Collatz conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103589)
