HackerTube 中文?

Stephen Wolfram: Complexity and the Fabric of Reality | Lex Fridman Podcast #234

Lex FridmanYouTube ↗

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 · Does knowing the rule give you the millionth step?

Caption notes

Wolfram frames computational irreducibility as a prediction question. Writing down a rule is straightforward. Getting a specified millionth-step answer with far less computation needs a separate argument.

Public machine transcript (may contain transcription errors) ↗
Original passages · 2
you can run it for a million steps
Stephen Wolfram: Complexity and the Fabric of Reality | Lex Fridman Podcast #234 · ▶ 8:15–8:17
I don't have to go through anything like that computational effort
Stephen Wolfram: Complexity and the Fabric of Reality | Lex Fridman Podcast #234 · ▶ 8:26–8:29

Hacker News comments

View original on HN ↗