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
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 ≥ 101.
Read more about McCarthy 91 Function: History, Examples, Code, Proof, Knuth's Generalization
Famous quotes containing the words mccarthy and/or function:
“A man has to be Joe McCarthy to be called ruthless. All a woman has to do is put you on hold.”
—Marlo Thomas (b. 1943)
“We are thus able to distinguish thinking as the function which is to a large extent linguistic.”
—Benjamin Lee Whorf (1897–1934)