Abstraction and Godel
Keith delves into the dichotomy between mechanistic performance and abstraction, connecting it to Godel's proof about the limitations of finite formal systems. Noam discusses the idea that within any closed system, there exist true statements that cannot be proven within that system, shedding light on the boundaries of knowledge and proof.In this clip
From this podcast
Machine Learning Street Talk (MLST)
MLST #78 - Prof. NOAM CHOMSKY (Special Edition)
Related Questions
Can formal systems be computed as discussed in the episode Stephen Wolfram: Cellular Automata, Computation, and Physics | Lex Fridman Podcast #89 and the clip Infinity and Computation, in relation to the episode Edward Frenkel: Reality is a Paradox - Mathematics, Physics, Truth & Love | Lex Fridman Podcast #370 and the clip Mathematical Foundations?
Can formal systems be computed as discussed in the episode Stephen Wolfram: Cellular Automata, Computation, and Physics | Lex Fridman Podcast #89 and the clip Infinity and Computation, in relation to the episode Edward Frenkel: Reality is a Paradox - Mathematics, Physics, Truth & Love | Lex Fridman Podcast #370?
Can formal systems be computed as discussed in the episode Stephen Wolfram: Cellular Automata, Computation, and Physics | Lex Fridman Podcast #89 and the clip Computational Foundations of Physics, in relation to the episode Edward Frenkel: Reality is a Paradox - Mathematics, Physics, Truth & Love | Lex Fridman Podcast #370 and this Mathematical Foundations?