Strauss had published a detailed and extensive critique of Havelock's " The Liberal Temper in Greek Politics " in March 1959, as " The Liberalism of Classical Political Philosophy " in the journal " Review of Metaphysics . " ( Strauss died 14 years later in 1973, the same year in which Havelock retired . ) Havelock's 1988 lecture claims to contain a systematic account of Plato's politics; Havelock argues that Plato's idealism applies a mathematical strictness to politics, countering his old teacher Cornford's assertion that Platonic arguments that morality must be analyzable in arithmetical terms cannot be serious.
42.
:: The big fish : Computational complexity theory . . some others : Computability theory ( computer science ) Recursion theory Delta Debugging NP-complete Oracle machine Rice's theorem ( it's impossible to look at any code without executing it and tell what it does, although the theorem is a more general case than that ) Abstract machine Context-free grammar ( an interesting problem in NP-completeness ) Automata theory Abstraction ( computer science ) Post correspondence problem ( a very simple similar problem to the halting problem but is easier to understand ) Kolmogorov complexity ( the blue whale of impossiblility problems, and surprisingly pertinent to code analysis-it's not necessarily analyzable beyond just stating the code itself ) Annnd of course the obligatory G�del's incompleteness theorems.
