An automated approach to the Collatz conjecture
From MaRDI portal
Publication:2055879
DOI10.1007/978-3-030-79876-5_27OpenAlexW3184383014MaRDI QIDQ2055879
Marijn J. H. Heule, Scott Aaronson, Emre Yolcu
Publication date: 1 December 2021
Full work available at URL: https://arxiv.org/abs/2105.14697
Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Termination of string rewriting proved automatically
- Mechanizing and improving dependency pairs
- Matrix interpretations for proving termination of term rewriting
- The Collatz problem
- Termination of term rewriting using dependency pairs
- Wildness of iteration of certain residue-class-wise affine mappings
- Tag systems and Collatz-like functions
- Local Termination: theory and practice
- Cellular Automata, the Collatz Conjecture and Powers of 3/2
- 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
- ARITHMETIC IN THE FORM
- Term Rewriting and All That
- Small universal one-state linear operator algorithm
- Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs
- Theory and Applications of Satisfiability Testing
- An unsolved problem on the powers of 3/2
- Formal Reductions of the General Combinatorial Decision Problem
This page was built for publication: An automated approach to the Collatz conjecture
