how much can you do with a system where for all functions f f(f(x)) = f(x)?
-
-
e.g. say x is a compound of 2 numbers, and f_1 is a function. f_1({n, i}) = if i != 1 then {2 * n, 1} else {n, i}.
-
create near-identical functions f_2, f_3, ... and you can repeat this operation indefinitely, all while following your rule
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.