Berkeley ACM A.M. Turing Laureate Colloquium 2018
2018-09-26..2018-10-24
Berkeley, United States
[Symposium on Visions of the Theory of Computing 2013, Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025, Securing Computation (Simons Institute, June 2015), Proof Complexity and Meta-Mathematics 2023, VMCAI 2025, The Role of TCS in Modern Machine Learning]
who it's for
theoretical computer scientists, cryptographers, hardware architects, systems security engineers, machine learning researchers, AI researchers
topics
public key cryptography; post-quantum cryptography; zero-knowledge proofs; SNARKs and succinct proofs; encrypted machine learning; RISC-V and open ISAs; domain-specific accelerators (TPU-style); speculative execution side channels; global workspace consciousness models; resolution-based SAT solving; linear programming plus cutting planes for TSP; P versus NP reductions
| title | author | length |
|---|---|---|
| From Basic Idea to Impact: the story of modern cryptography | Shafi Goldwasser | 01h 02m |
Chronicles how a handful of concrete ideas become everyday infrastructure: the 1976 Diffie-Hellman/RSA blueprint for public key systems that takes roughly 25… | ||
| Proofs, Knowledge, and Computation | Silvio Micali | 01h 03m |
Describes an interactive protocol that proves graph non‑isomorphism by the verifier choosing a random permutation of either G or H and the prover identifying… | ||
| A New Golden Age for Computer Architecture | David Patterson | 01h 16m |
History of instruction sets moves from microcode to RISC to open ISAs and domain-specific chips; claim is that raised software/hardware interfaces enable far… | ||
| Towards a Conscious AI | Manuel Blum | 01h 18m |
Proposes a formal “Conscious Turing Machine” architecture inspired by Baars’s global workspace: sensory inputs go to many specialized processors, whatever… | ||
| Computational Complexity in Theory and in Practice | Richard M. Karp | 01h 21m |
Survey of concrete claims and tools: Cook's reduction makes SAT the P vs NP focal point; NP-completeness follows by polynomial-time reductions. Industrial SAT… | ||
| nothing matches | ||