The inverse of Ackermann function is computable in linear time
We propose a detailed proof of the fact that the inverse of Ackermann function is computable in linear time.
cs.CC↗
arXiv subjects
Claude Sureson
Publications and source records attributed to Claude Sureson.
Subcomputable Schnorr Randomness
The notion of Schnorr randomness refers to computable reals or computable functions. We propose a version of Schnorr randomness for subcomputable classes and characterize it in different ways: by Martin Löf tests, martingales or measure computable machines.
cs.LO↗