Definitions:
Section 1.
	The lexicographic ordering
	f = O(g)
Section 2.
	An algorithm;
	Turing machine;
	Universal Turing machine;
	Boolean function;
Section 3.
	recursive or computable function;
	recursive language;
	recursively enumerable language;
Section 4.
	The time demand of a Turing machine;
	polynomial Turing machine;
	DTIME(f(n));
	PTIME;
Section 5.
	fully time-constructible function;
	well-computable function;


Theorems:
Section 3.
	Rice's Theorem;
	Give 3 examples for undecidable problems;
	GÖdel's incompleteness theorem (Theorem 3.4.2)
	Gödel's completeness theorem (Theorem 3.4.3)
Section 4.
	Give 3 examples Polynomial time algorithms in arithmetic
	Give 3 examples Polynomial time Graph algorithms
Section 5.
	Linear Speedup Theorem;
	Gap Theorem;
	Speed-up Theorem;