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 for integer n as:
Remarkably, the function yields 
for all 
(hence, the function name).
for all (hence, the function name).A more generalized form of the McCarthy's recursive function is defined below:
For positive integers a, b, c, k, and n.
The expression 
, means applying the function G, k number of times:
, means applying the function G, k number of times:
This means that the 'original' McCarthy-91 function 
is actually 
, with 
, 
, 
and 
.
is actually , with , , and .Given integers, a, b, c, k, and n, evaluate the value of .
.--------------------
NOTE: The McCarthy-91 function was created to test recursive function implementations. In this problem, while iterative loops are allowed, use of recursion is encouraged.
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers5
Suggested Problems
-
Back to basics 11 - Max Integer
812 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
654 Solvers
-
Put Two 1D matrices into one 1D matrix
142 Solvers
-
Returning a "greater than" vector
278 Solvers
-
128 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
