Backlinks

Thesis. The asymptotics of language

Note. Probable approximate correctness

Reference. Probably approximately correct: nature's algorithms for learning and prospering in a complex world

Reference. Cryptographic limitations on learning Boolean formulae and finite automata