An automated approach to the Collatz conjecture
From MaRDI portal
Publication:6103589
DOI10.1007/s10817-022-09658-8OpenAlexW3166186589WikidataQ123249511 ScholiaQ123249511MaRDI QIDQ6103589
Scott Aaronson, Emre Yolcu, Marijn J. H. Heule
Publication date: 27 June 2023
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-022-09658-8
terminationstring rewritingSAT solvingCollatz conjecturematrix interpretationscomputer-assisted mathematics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compiling finite linear CSP into SAT
- Termination of string rewriting proved automatically
- Mechanizing and improving dependency pairs
- Matrix interpretations for proving termination of term rewriting
- The Collatz problem
- Positive rational sequences
- Termination of term rewriting: Interpretation and type elimination
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Termination of term rewriting using dependency pairs
- An automated approach to the Collatz conjecture
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Wildness of iteration of certain residue-class-wise affine mappings
- Tag systems and Collatz-like functions
- Local Termination: theory and practice
- Termination of Cycle Rewriting by Transformation and Matrix Interpretation
- Cellular Automata, the Collatz Conjecture and Powers of 3/2
- Improved Matrix Interpretation
- Problems in number theory from busy beaver competition
- Termination of String Rewriting with Matrix Interpretations
- The 3x + 1 Problem and Its Generalizations
- Imitation of an Iteration
- On some Markov matrices arising from the generalized Collatz mapping
- Some Unconventional Problems in Number Theory
- GRASP: a search algorithm for propositional satisfiability
- ARITHMETIC IN THE FORM
- Term Rewriting and All That
- Lower bounds for the total stopping time of 3𝑥+1 iterates
- On Non-Computable Functions
- Termination proofs and the length of derivations
- Small universal one-state linear operator algorithm
- Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs
- Revisiting Matrix Interpretations for Proving Termination of Term Rewriting
- The Undecidability of the Generalized Collatz Problem
- An unsolved problem on the powers of 3/2
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Formal Reductions of the General Combinatorial Decision Problem
This page was built for publication: An automated approach to the Collatz conjecture
