Problems in number theory from busy beaver competition

DOI10.2168/LMCS-11(4:10)2015zbMath1448.03028arXiv1311.1029MaRDI QIDQ3460412

Pascal Michel

Publication date: 7 January 2016

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

busy beaverCollatz-like functions

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Turing machines and related notions (03D10) Classical models of computation (Turing machines, etc.) (68Q04)

Related Items (3)

Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) ⋮ An automated approach to the Collatz conjecture ⋮ An automated approach to the Collatz conjecture

This page was built for publication: Problems in number theory from busy beaver competition