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:
“... it was religion that saved me. Our ugly church and parochial school provided me with my only aesthetic outlet, in the words of the Mass and the litanies and the old Latin hymns, in the Easter lilies around the altar, rosaries, ornamented prayer books, votive lamps, holy cards stamped in gold and decorated with flower wreaths and a saint’s picture.”
—Mary McCarthy (1912–1989)
“As a medium of exchange,... worrying regulates intimacy, and it is often an appropriate response to ordinary demands that begin to feel excessive. But from a modernized Freudian view, worrying—as a reflex response to demand—never puts the self or the objects of its interest into question, and that is precisely its function in psychic life. It domesticates self-doubt.”
—Adam Phillips, British child psychoanalyst. “Worrying and Its Discontents,” in On Kissing, Tickling, and Being Bored, p. 58, Harvard University Press (1993)