Tau Language: The Software Synthesis Future [Sponsored] - Ohad Asor
This sponsored episode features mathematician Ohad Asor discussing logical approaches to AI, focusing on the limitations of machine learning and introducing the Tau language for software development and blockchain tech. SPONSOR MESSAGES: *** Tufa AI Labs is a brand new research lab in Zurich started by Benjamin Crouzier focussed on o-series style reasoning and AGI. They are hiring a Chief Engineer and ML engineers. Events in Zurich. Mathematician Ohad Asor makes the case that machine learning has fundamental theoretical ceilings -- PAC learning guarantees only probabilistic approximate correctness, and beyond a certain problem complexity, neural nets perform no better than coin tosses. His… --- TIMESTAMPS: 00:00:00 Fundamental Limitations of Machine Learning and PAC Learning Theory 00:04:50 Transductive Learning and the Three Curses of Machine Learning 00:08:57 Language, Reality, and AI System Design 00:12:58 Program Synthesis and Formal Verification Approaches 00:21:00 Definability, Computability, and the Halting Problem 00:31:55 Self-Referential Language and Tarski's Influence 00:34:00 Boolean Algebra and Logical Foundations of Tau 00:40:00 SAT Solvers, DPLL/CDCL, and the Revival of Logical AI 00:47:50 Program Synthesis and Specification in the Tau Language 01:00:00 Pointwise Revision and Belief Revision Theory 01:06:00 Quantifier Elimination and Normalization 01:10:30 User Control and Software Governance via Blockchain 01:24:00 Automation, Finance, and the Future of Blockchain Economics --- REFERENCES: Company: [00:00:47] Tau Language https://tau.ai/tau-language/ [00:00:47] Tau Language GitHub https://github.com/IDNI/tau-lang [01:11:40] Tau Net Blockchain Platform https://tau.net/ Paper: [00:03:03] PAC Learning Framework https://en.wikipedia.org/wiki/Probably_approximately_correct_learning [00:05:42] Boolean Satisfiability Problem https://en.wikipedia.org/wiki/Boolean_satisfiability_problem [00:13:51] Knowledge as Justified True Belief https://plato.stanford.edu/entries/epistemology/ [00:21:25] Theories and Applications of Boolean Algebras https://tau.net/Theories-and-Applications-of-Boolean-Algebras-0.29.pdf [00:26:00] The Halting Problem https://plato.stanford.edu/entries/turing-machine/#HaltProb [00:41:40] DPLL and CDCL SAT Solving Algorithms https://www.cs.princeton.edu/~zkincaid/courses/fall18/readings/SATHandbook-CDCL.pdf [00:49:20] Tarski Undefinability Theorem https://plato.stanford.edu/entries/tarski-truth/ [00:50:50] Boolean Algebra Foundations https://plato.stanford.edu/entries/boolalg-math/ [01:02:27] Belief Revision Theory https://plato.stanford.edu/entries/logic-belief-revision/ [01:05:30] Quantifier Elimination in Boolean Algebra https://people.math.wisc.edu/~hkeisler/random.pdf [01:19:10] Tau Whitepaper https://tau.net/Whitepaper.pdf Person: [00:17:20] Wittgenstein on Limits of Language https://plato.stanford.edu/entries/wittgenstein/ [00:30:00] Alfred Tarski https://plato.stanford.edu/entries/tarski/ --- LINKS: Full Transcript: https://app.rescript.info/share/dbb6e25a5cde17f66e6847ffdc4ac728 Download PDF transcript: https://app.rescript.info/api/public/sessions/9403107f522d646c/pdf --- REFERENCES: Company: [00:00:47] Tau Language https://tau.ai/tau-language/ [00:00:47] Tau Language GitHub https://github.com/IDNI/tau-lang [01:11:40] Tau Net Blockchain Platform https://tau.net/ Paper: [00:03:03] PAC Learning Framework https://en.wikipedia.org/wiki/Probably_approximately_correct_learning [00:05:42] Boolean Satisfiability Problem https://en.wikipedia.org/wiki/Boolean_satisfiability_problem [00:13:51] Knowledge as Justified True Belief https://plato.stanford.edu/entries/epistemology/ [00:21:25] Theories and Applications of Boolean Algebras https://tau.net/Theories-and-Applications-of-Boolean-Algebras-0.29.pdf [00:26:00] The Halting Problem https://plato.stanford.edu/entries/turing-machine/#HaltProb [00:41:40] DPLL and CDCL SAT Solving Algorithms https://www.cs.princeton.edu/~zkincaid/courses/fall18/readings/SATHandbook-CDCL.pdf [00:49:20] Tarski Undefinability Theorem https://plato.stanford.edu/entries/tarski-truth/ [00:50:50] Boolean Algebra Foundations https://plato.stanford.edu/entries/boolalg-math/ [01:02:27] Belief Revision Theory https://plato.stanford.edu/entries/logic-belief-revision/ [01:05:30] Quantifier Elimination in Boolean Algebra https://people.math.wisc.edu/~hkeisler/random.pdf [01:19:10] Tau Whitepaper https://tau.net/Whitepaper.pdf Person: [00:17:20] Wittgenstein on Limits of Language https://plato.stanford.edu/entries/wittgenstein/ [00:30:00] Alfred Tarski https://plato.stanford.edu/entries/tarski/ GitHub: https://github.com/IDNI/tau-lang
