FAQ

Ackermann function

Known as: Ackermann's function, Ackerman's function, Ackermann 
In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1938-2017
020406019382016

Related topics

Related topics

38 relations
AlgorithmAlgorithm characterizationsAsymptotically optimal algorithmBlooP and FlooP
(More)

Broader (1)

Theory of computation

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Ackermann function
Algorithm
Computational complexity theory
Compiler
Recursion
F-algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets. 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Ackermann's substitution method (remixed)
We aim at a conceptually clear and technical smooth investigation of Ackermann’s substitution method. Our analysis provides a… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2003
2003
Optimizing Ackermann's function by incrementalization
This paper describes a formal derivation of an optimized Ackermann's function following a general and systematic method based on… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study
Hannenhalli and Pevzner gave the first polynomial-time algorithm for computing the inversion distance between two signed… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is <italic>0… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Pointwise Semigroup Methods and Stability of Viscous Shock Waves
Considered as rest points of ODE on L, stationary viscous shock waves present a critical case for which standard semigroup… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
1992
1992
The Turing machine of Ackermann's function
211( x , y ) = x + y ; 2t„+i( x , 1 ) = x ; 2t,l+i( x , y + 1 ) = Zan{ x , 2tn-f-1( x > y ) } although of more potent growth than… (More)
Is this relevant?
1986
1986
Ackermann's function in Ada
Ackermann's function was originally written to illustrate some problems wit h computable functions [1]. From the point of view of… (More)
Is this relevant?
1977
1977
How to Call Procedures, or Secong Thoughts on Ackermann's Function
Various problems have been encountered in using Ackermann’s function to measure the efficiency of procedure calIs in System… (More)
Is this relevant?
1971
1971
The Ackermann function in APL
A programming language - such as APL with the execute operator - will normally have an Ackermann rating of infinity if it can… (More)
Is this relevant?