The inverse of Ackermann function is computable in linear time

09/13/2021
by   Claude Sureson, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/01/2020

Erratum to "Frequency Linear-time Temporal Logic"

We correct our proof of a theorem stating that satisfiability of frequen...
research
03/12/2018

Linear-Time In-Place DFS and BFS in the Restore Model

We present an in-place depth first search (DFS) and an in-place breadth ...
research
06/28/2022

Which arithmetic operations can be performed in constant time in the RAM model with addition?

In the literature of algorithms, the specific computation model is often...
research
01/24/2021

A greedy algorithm for dropping digits (Functional Pearl)

Consider the puzzle: given a number, remove k digits such that the resul...
research
04/08/2019

On Functions Weakly Computable by Pushdown Petri Nets and Related Systems

We consider numerical functions weakly computable by grammar-controlled ...
research
04/24/2023

The Game Chromatic Number of Complete Multipartite Graphs with No Singletons

In this paper we investigate the game chromatic number for complete mult...
research
06/20/2018

Random Feature Stein Discrepancies

Computable Stein discrepancies have been deployed for a variety of appli...

Please sign up or login with your details

Forgot password? Click here to reset