## Imitation Games – Avi Wigderson

…

If you wish to skip the introduction the talk starts at 5.20. The talk itself lasts roughly an hour, with the last ca. 20 minutes devoted to Q&A – that part is worth watching as well.

Some links related to the talk below:

Theory of computation.

Turing test.

COMPUTING MACHINERY AND INTELLIGENCE.

Probabilistic encryption & how to play mental poker keeping secret all partial information Goldwasser-Micali82.

Probabilistic algorithm

How To Generate Cryptographically Strong Sequences Of Pseudo-Random Bits (Blum&Micali, 1984)

Randomness extractor

Dense graph

Periodic sequence

Extremal graph theory

Szemerédi’s theorem

Green–Tao theorem

Szemerédi regularity lemma

New Proofs of the Green-Tao-Ziegler Dense Model Theorem: An Exposition

Calibrating Noise to Sensitivity in Private Data Analysis

Generalization in Adaptive Data Analysis and Holdout Reuse

Book: Math and Computation | Avi Wigderson

One-way function

Lattice-based cryptography

No comments yet.

## Leave a Reply