In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a totalâ€¦Â (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

- Philippe Schnoebelen
- MFCS
- 2010

We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.Â

Is this relevant?

2006

2006

- Georg Moser
- Ann. Pure Appl. Logic
- 2006

We aim at a conceptually clear and technical smooth investigation of Ackermannâ€™s substitution method. Our analysis provides aâ€¦Â (More)

Is this relevant?

2003

2003

- Yanhong A. Liu, Scott D. Stoller
- PEPM
- 2003

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

- David A. Bader, Bernard M. E. Moret, Mi Yan
- WADS
- 2001

Hannenhalli and Pevzner gave the first polynomial-time algorithm for computing the inversion distance between two signedâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Bernard Chazelle
- J. ACM
- 2000

A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is <italic>0â€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

Considered as rest points of ODE on L, stationary viscous shock waves present a critical case for which standard semigroupâ€¦Â (More)

Is this relevant?

1992

1992

- Muhammad Ali McBeth
- SIGA
- 1992

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

- B. A. Wichmann
- ALET
- 1986

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

- Brian A. Wichmann
- Softw., Pract. Exper.
- 1977

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

- Theodore A. Linden
- SIGP
- 1971

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?