I'd love to see a vid on the recursion theorem and it's subtleties 😀
@MathForLife3 жыл бұрын
Recursion theorem?
@platosbeard34763 жыл бұрын
I think that's what it's called :/ From my book: If X is a set, f: X -> X is a function, and c is an element of X, then there exists a unique function P: N_0 -> X (that's the natural numbers starting from 0 defined using Peano) such that: 1. P(0) = c 2. P(s(n)) = f(P(n)) for all n in N_0 ( s(n) is the successor function) Basically, we can take the natural numbers we've just defined and using this theorem we can then go and define addition, multiplication, factorial functions, etc., basically, any function that has a recursive definition.
@aashsyed12773 жыл бұрын
wow. when gonna celebrate 8k subs?
@myoung14453 жыл бұрын
Celebrate 10 not 8
@MathForLife3 жыл бұрын
Ahaha, a good point. Sorry, I have been busy with life.