Naturalmente non sarebbe divertente se uno non pensasse di avere ragione.
Quindi:
xor:
false, false -> true
false, true-> true
true, false -> true
true, true -> false
------------------
++a -> b = a; a = a+1; return a
a++ -> b = a; a = a+1; return b
-------------------
f(0) -> 1
f(n) -> f(n-1) + 1
---------------
f(0) -> 1
f(n) ->f(n-1)*n
------------
f(0) -> 1
f(1) -> 1
f(n) -> f(n-1) + f(n-2)
----------------
f(0) -> c0
...
f(k-1) -> c[k-1]
f(n) -> g(f(n-1), .. f(n-k))
-----------
f(0,0,z) -> z
f(1,0,z) -> 0
f(0,y,z) -> f(0,y-1,z) + 1
f(x,0,z) -> 1
f(x,y,z) -> f(x-1, f(x, y-1,z), z)
Sufficiente?