HackerTube 中文?

Stephen Wolfram: Cellular Automata, Computation, and Physics | Lex Fridman Podcast #89

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 recalls discovering the pattern of Rule 30 by running it. Simple initial conditions give intricate output, while the picture itself supplies no method for skipping the computation.

Public machine transcript (may contain transcription errors) ↗
Original passages · 2
from very simple initial conditions, it makes really complicated behavior
Stephen Wolfram: Cellular Automata, Computation, and Physics | Lex Fridman Podcast #89 · ▶ 94:00–94:06
no intuition, just experimental science
Stephen Wolfram: Cellular Automata, Computation, and Physics | Lex Fridman Podcast #89 · ▶ 95:23–95:26

Hacker News comments

View original on HN ↗