HackerTube 中文?

Turing & The Halting Problem - Computerphile

ComputerphileYouTube ↗

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 changes when “this program” becomes “every program”?

Caption notes

Take a proposed universal halting decider, reverse its prediction, and feed the resulting program its own description. Each possible answer contradicts what the constructed program does next.

Archived captions (transcription method unspecified) ↗
Original passages · 2
I make it loop forever without ever stopping
Turing & The Halting Problem - Computerphile · ▶ 4:16–4:19
Either way we get a contradiction
Turing & The Halting Problem - Computerphile · ▶ 5:17–5:22

Hacker News comments

View original on HN ↗