notebook
Computability and Complexity
Categories: Computing and Math.
Tags: Number theory, Fermat's Last Theorem, Diagonal argument, First-order logic, NP-completeness, Andrew Wiles, Richard Borcherds, Ryan Williams (computer scientist), Millennium Prize Problems, Philosophy, Gödel's incompleteness theorems, Turing machine, Halting problem, Logic, Busy beaver, Peano axioms, Zermelo–Fraenkel set theory, P versus NP problem.
Comments
? comments