Backlinks

Thesis. The asymptotics of language

Note. NP-hardness

Note. Computational complexity and philosophy

Reference. P ?= NP

Reference. Why Philosophers Should Care about Computational Complexity

Reference. Guest Column: NP-complete problems and physical reality