Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Herein we report the unprecedented Fujiwara–Moritani reaction catalysed by the commercially available heterogeneous palladium… 
2017
2017
Forgetting refers to a non-standard reasoning problem concerned with eliminating concept and role symbols from description logic… 
2015
2015
For identification and structural studies, viruses are concentrated and purified by differential or density gradient… 
2011
2011
The Cygnus region hosts a giant molecular-cloud complex which actively forms massive stars. Interactions of cosmic rays with… 
Highly Cited
2007
Highly Cited
2007
Wind power integration into power systems has two dimensions: an economical one related to optimization of the resources and a… 
Highly Cited
2005
Highly Cited
2005
This paper deals with the direct solution of the pole placement problem by state-derivative feedback for multi- input linear… 
Highly Cited
2000
Highly Cited
2000
This paper argues that particle verb combinations do not display a uniform structure but are represented either as a small clause… 
1993
1993
In recent years interesting decidability results for syntactically specified classes of clause sets have been achieved by… 
Highly Cited
1989
Highly Cited
1989
The authors introduce a fundamentally novel parallel data structure, called recursive *-tree (star tree). For its definition…