HackerTube 中文?

Lecture 1B | MIT 6.001 Structure and Interpretation, 1986

MIT OpenCourseWareYouTube ↗

Further reading 1

What can a language express, and what can it guarantee? →Factorial can be written without naming the function. That trick raises a harder question: if every program must terminate, can unrestricted recursion be allowed? Take that distinction into slides, libraries and language extensions.This video helps answer · What does a recursive call leave behind?

Caption notes

Two self-referential definitions of addition produce different processes. One carries the answer forward, while the other leaves increments pending until calls return.

Video or transcript source ↗
Original passages · 2
those are both recursive definitions.
Lecture 1B | MIT 6.001 Structure and Interpretation, 1986 · ▶ 30:25–30:27
There's nothing special about the fact that the definition is recursive that leads to a recursive process.
Lecture 1B | MIT 6.001 Structure and Interpretation, 1986 · ▶ 30:37–30:46

Hacker News comments

View original on HN ↗