Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

39 relations
AlgorithmAlgorithm characterizationsAsymptotically optimal algorithmBlooP and FlooP
Expand

Broader (2)

Computability theoryTheory of computation

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?
Highly Cited
2008
Highly Cited
2008
The Evolution of L and T Dwarfs in Color-Magnitude Diagrams
We present new evolution sequences for very low mass stars, brown dwarfs, and giant planets and use them to explore a variety of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Clarifying the Construct of Mindfulness in the Context of Emotion Regulation and the Process of Change in Therapy
Bishop et al. (this issue) propose an operational definition of mindfulness developed by a recent consensus panel. The group… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Finding patterns in the fieldwork
This paper considers the potential of using patterns of cooperative interaction to support the development of general design… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A Call for the Teaching of Writing in Graduate Education
small but growing research literature on writing at the graduate level, most of it dealing with the appropriation of disciplinary… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Thermal and fitness-related consequences of nest location in Painted Turtles (Chrysemys picta)
1. Laboratory experiments have documented substantial temperature effects on the physiological ecology of reptilian eggs, embryos… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The Value of Diversification During the Conglomerate Merger Wave
The current trend toward corporate focus reverses the diversification trend of the late 1960s and early 1970s. This article… Expand
Is this relevant?
1988
1988
0-1 laws and decision problems for fragments of second-order logic
Fragments of existential second-order logic are investigated in which the patterns of first order quantifiers are restricted. The… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Maternal rank and offspring rank in vervet monkeys: An appraisal of the mechanisms of rank acquisition
Abstract In two troops of vervet monkeys ( Cercopithecus aethiops sabaeus ) in Barbados, maternal rank predicted the outcomes of… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE