Not so primitive:ack 0 n = n + 1ack m 0 = ack (m-1) 1ack m n = ack (m-1) (ack m (n-1))Bwahahahahhahahaaa!!!
You can't fool me! That's a total computable function not a primitive recursive function. My son looked it up on Wikipedia!
Gawd, raising yer son to be a philosopher! Come the revolution, this will be recognized as cruelty to children, and punished by making the perpetrator compute the Goedel numbers of simple, yet nontrivial proofs in arithmetic.
Post a Comment