Daniel will be giving a guest lecture on Turing machines, computability, and undecidable problems.
Daniel’s website may be found here.
These considerations occur surprisingly often (e.g. in programming languages) and are at the heart of foundational issues in computing and mathematics (e.g. provability).
Previous: AlphaTensor and reinforcment learning
Jerry will be giving a guest lecture on AlphaTensor, starting with a brief overview of reinforcement learning and Monte Carlo tree search.
continue reading ❯