The inverse of Ackermann function is computable in linear time

TL;DR

This paper provides a detailed proof demonstrating that the inverse of the Ackermann function can be computed efficiently in linear time, addressing a fundamental question in computational complexity.

Contribution

It offers a comprehensive proof establishing the linear-time computability of the inverse Ackermann function, which was previously not explicitly detailed.

Findings

Inverse Ackermann function is computable in linear time

Provides a detailed proof of the computational complexity

Clarifies the computational bounds of the inverse Ackermann function

Abstract

We propose a detailed proof of the fact that the inverse of Ackermann function is computable in linear time.