An automated approach to the Collatz conjecture

DOI10.1007/978-3-030-79876-5_27MaRDI QIDQ2055879zbMATH OpenOpenAlexFDO

Authors Emre Yolcu, Scott Aaronson, Marijn J. H. Heule

Publication date 1 December 2021

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2105.14697

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

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

• scientific article; zbMATH DE number 2182446 (Why is no real title available?)
• scientific article; zbMATH DE number 2236594 (Why is no real title available?)
• ARITHMETIC IN THE FORM
• An unsolved problem on the powers of 3/2
• Cellular Automata, the Collatz Conjecture and Powers of 3/2
• Formal Reductions of the General Combinatorial Decision Problem
• Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs
• Imitation of an Iteration
• Local termination: theory and practice
• Matrix interpretations for proving termination of term rewriting
• Max/Plus tree automata for termination of term rewriting
• Mechanizing and improving dependency pairs
• On some Markov matrices arising from the generalized Collatz mapping
• Problems in number theory from busy beaver competition
• 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 String Rewriting with Matrix Interpretations
• Termination of string rewriting proved automatically
• Termination of term rewriting using dependency pairs
• The 3x + 1 Problem and Its Generalizations
• The Collatz problem
• The ultimate challenge. The \(3x+1\) problem
• Theory and Applications of Satisfiability Testing
• Wildness of iteration of certain residue-class-wise affine mappings

Cited in

(3)

• Half an Induction Proof of the Collatz Conjecture
• An automated approach to the Collatz conjecture
• Cellular Automata, the Collatz Conjecture and Powers of 3/2

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 Q2055879)