Partial Recursive Functions 3: Composition

[@BelegaerTheGreat]

One of the best educational video series on the internet. You should do this for life!

[@user-nc4sj5ht2s]

Man, you saved my life.

[@taniushkaaa]

Very well explained. Thank you a lot!

[@lucianoferrara4781]

Thanks for the great video series. Could you share the book title used throughout the course? You explained the topics very simply and my hope was to find the rest of the course on the book you used at your University. Thanks

[@saravananm2280]

You made this concept really exciting. Thank you very much

[@lolomimama193]

Brilliant. Was needing this.

[@ivanoval1]

Thank you for work. it's very good material feed.

[@joseville]

7:37 how would one actually define add in this system? I know how to do it in lambda calculus using n-fold composition on the successor function, but not sure how to bring that over to this system?

[@davidgao3005]

It is in the next video

[@lucianoinso]

Thank you!

[@joseville]

3:17 I was a bit confused at first why you're defining composition in this way which is so different than how I've seen it defined, but then I realized the composition I'm used to is just the case where n=1 f ᐤ [g1]x = f(g(x)) Can n be 0? I.e. f ᐤ [] = f() would be a the composition of a function that takes no arguments (such as zero^0) with 0 functions).

[@mohammednurhussien3285]

please do for us another examples of composition