McCarthy 91 function
The McCarthy 91 function is a recursive function, defined by the computer scientist John McCarthy as a test case for formal verification within computer science.
≈ 6 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
The McCarthy 91 function is a recursive function, defined by the computer scientist John McCarthy as a test case for formal verification within computer science.
The McCarthy 91 function is defined as
- M(n)={n−10,if n>100 M(M(n+11)),if n≤100
The results of evaluating the function are given by M(n) = 91 for all integer arguments n ≤ 100, and M(n) = n − 10 for n > 100. Indeed, the result of M(101) is also 91 (101 - 10 = 91). All results of M(n) after n = 101 are continually increasing by 1, e.g. M(102) = 92, M(103) = 93.
History
edit edit sourceThe 91 function was introduced in papers published by Zohar Manna, Amir Pnueli and John McCarthy in 1970. These papers represented early developments towards the application of formal methods to program verification. The 91 function was chosen for being nested-recursive (contrasted with single recursion, such as defining f(n) by means of f(n−1)). The example was popularized by Manna's book, Mathematical Theory of Computation (1974). As the field of Formal Methods advanced, this example appeared repeatedly in the research literature. In particular, it is viewed as a "challenge problem" for automated program verification.
It is easier to reason about tail-recursive control flow, this is an equivalent (extensionally equal) definition:
- Mt(n)=Mt′(n,1)
- Mt′(n,c)={n,if c=0Mt′(n−10,c−1),if n>100 and c≠0Mt′(n+11,c+1),if n≤100 and c≠0
As one of the examples used to demonstrate such reasoning, Manna's book includes a tail-recursive algorithm equivalent to the nested-recursive 91 function. Many of the papers that report an "automated verification" (or termination proof) of the 91 function only handle the tail-recursive version.
This is an equivalent mutually tail-recursive definition:
- Mmt(n)=Mmt′(n,0)
- Mmt′(n,c)={Mmt″(n−10,c),if n>100 Mmt′(n+11,c+1),if n≤100
- Mmt″(n,c)={n,if c=0 Mmt′(n,c−1),if c≠0
A formal derivation of the mutually tail-recursive version from the nested-recursive one was given in a 1980 article by Mitchell Wand, based on the use of continuations.
Examples
edit edit sourceExample A:
M(99) = M(M(110)) since 99 ≤ 100 = M(100) since 110 > 100 = M(M(111)) since 100 ≤ 100 = M(101) since 111 > 100 = 91 since 101 > 100Example B:
M(87) = M(M(98)) = M(M(M(109))) = M(M(99)) = M(M(M(110))) = M(M(100)) = M(M(M(111))) = M(M(101)) = M(91) = M(M(102)) = M(92) = M(M(103)) = M(93) .... Pattern continues increasing till M(99), M(100) and M(101), exactly as we saw on the example A) = M(101) since 111 > 100 = 91 since 101 > 100Code
edit edit sourceHere is an implementation of the nested-recursive algorithm in Python:
def mc91(n: int) -> int: if n > 100: return n - 10 else: return mc91(mc91(n + 11))Here is an implementation of the tail-recursive algorithm in Python:
def mc91(n: int) -> int: return mc91taux(n, 1) def mc91taux(n: int, c: int) -> int: if c == 0: return n elif n > 100: return mc91taux(n - 10, c - 1) else: return mc91taux(n + 11, c + 1)Proof
edit edit sourceHere is a proof that the McCarthy 91 function M is equivalent to the non-recursive algorithm M′defined as:
- M′(n)={n−10,if n>100 91,if n≤100
For n > 100, the definitions of M′ and M are the same. The equality therefore follows from the definition of M.
For n ≤ 100, a strong induction downward from 100 can be used:
For 90 ≤ n ≤ 100,
M(n) = M(M(n + 11)), by definition = M(n + 11 - 10), since n + 11 > 100 = M(n + 1)This can be used to show M(n) = M(101) = 91 for 90 ≤ n ≤ 100:
M(90) = M(91), M(n) = M(n + 1) was proven above = … = M(101), by definition = 101 − 10 = 91M(n) = M(101) = 91 for 90 ≤ n ≤ 100 can be used as the base case of the induction.
For the downward induction step, let n ≤ 89 and assume M(i) = 91 for all n < i ≤ 100, then
M(n) = M(M(n + 11)), by definition = M(91), by hypothesis, since n < n + 11 ≤ 100 = 91, by the base case.This proves M(n) = 91 for all n ≤ 100, including negative values.
Knuth's generalization
edit edit sourceDonald Knuth generalized the 91 function to include additional parameters.[1] John Cowles developed a formal proof that Knuth's generalized function was total, using the ACL2 theorem prover.[2]
References
edit edit source- ^ Knuth, Donald E. (1991). "Textbook Examples of Recursion". Artificial Intelligence and Mathematical Theory of Computation: 207–229. arXiv:cs/9301113. Bibcode:1993cs........1113K. doi:10.1016/B978-0-12-450010-5.50018-9. ISBN 9780124500105. S2CID 6411737.
{{cite journal}}: CS1 maint: periodical has ISBN (link) Wikipedia revision 1321323383, retrieved 2026-11-18 - ^ Cowles, John (2013) [2000]. "Knuth's generalization of McCarthy's 91 function". In Kaufmann, M.; Manolios, P.; Strother Moore, J (eds.). Computer-Aided reasoning: ACL2 case studies. Kluwer Academic. pp. 283–299. ISBN 9781475731880. Wikipedia revision 1321323383, retrieved 2026-11-18
- Manna, Zohar; Pnueli, Amir (July 1970). "Formalization of Properties of Functional Programs". Journal of the ACM. 17 (3): 555–569. doi:10.1145/321592.321606. S2CID 5924829.
- Manna, Zohar; McCarthy, John (1970). "Properties of programs and partial function logic". Machine Intelligence. 5. OCLC 35422131.
- Manna, Zohar (1974). Mathematical Theory of Computation (4th ed.). McGraw-Hill. ISBN 9780070399105.
- Wand, Mitchell (January 1980). "Continuation-Based Program Transformation Strategies". Journal of the ACM. 27 (1): 164–180. doi:10.1145/322169.322183. S2CID 16015891.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1321323383 under CC BY-SA 4.0; modifications have been made.
References
- ↩Wikipedia “McCarthy 91 function” publication date (×1) · confidence 0.95 revision URL