On Higher Order Busy Beaver Function
Computational Complexity
2025-07-30 v1 Formal Languages and Automata Theory
Logic in Computer Science
Abstract
In this paper, we extend Busy Beaver function to a class of higher order Busy Beaver functions based on Turing oracle machine. We prove some results about the relation between decidability of number theoretical formula and higher order Busy Beaver functions, and the relation between computability of max-min partial recursive functions and higher order Busy Beaver functions. We also present some conjectures on higher order Busy Beaver functions.
Keywords
Cite
@article{arxiv.2507.20321,
title = {On Higher Order Busy Beaver Function},
author = {Zining Cao},
journal= {arXiv preprint arXiv:2507.20321},
year = {2025}
}
Comments
7 pages