One man's lecture notes on computability theory

What follows are intended to be Dan Polansky's lecture notes on computability theory, also known as recursion theory. They are published in the hope that they may be helpful for someone else as well as a learning resource.

The initial plan to create a minimum functional artifact is to start with Luboš Brim's (who teaches computability) syllabus for computability theory course and create a set of links to relevant Wikipedia articles. Thus, one would learn by studying the Wikipedia articles one at a time. The plan is to then expand this page with lecture notes proper, but with the view that the purpose is not to duplicate Wikipedia; and thus, it would perhaps be in a bullet-point based outline-like matter; let us see.

One aim is to link to excellent freely available lecture notes online.

Luboš Brim's syllablus/course outline in Czech:
 * FI:IA046 Vyčíslitelnost - Informace o předmětu

Luboš Brim's textbook:
 * Vyčíslitelnost, fi.muni.cz -- available only within muni.cz domain (one would wish this was publicly available; one cannot earn so much money from that kind of textbook useful only for Czechs anyway, can one?)

Jan Strejček's syllablus/course outline in Czech on a course preceding the above one, providing a mere introduction and combining it with computational complexity theory:
 * FI:IB107 Vyčíslitelnost a složitost - Informace o předmětu

Wikipedia and Stanford Encyclopedia of Philosophy
Top Wikipedia articles/pages:
 * Computability theory
 * W: Category: Computability theory

Wikipedia articles choice of which is based on Luboš Brim's syllabus/course outline, with an extension from Jan Strejček's outline:

Preliminary course (Strejček)
 * Church–Turing thesis
 * Undecidable problem
 * Computable function
 * Partially decidable problem: see Recursively enumerable language

Advanced course (Brim):
 * Rice's theorem
 * Recursive language
 * Recursively enumerable language (see also Computably enumerable set)
 * Creative and productive sets
 * Simple set (also covers immune set)
 * Kleene's recursion theorem (AKA Rogers's fixed-point theorem)
 * Arithmetical hierarchy (Kleene–Mostowski hierarchy)
 * Gödel's incompleteness theorems
 * Oracle machine
 * Analytical hierarchy
 * Post correspondence problem

Other related Wikipedia articles:
 * Decidability (logic)
 * List of undecidable problems

Relating Stanford Encyclopedia of Philosophy (SEP) articles:
 * Computability and Complexity
 * Recursive functions
 * The Church-Turing Thesis
 * Gödel’s Incompleteness Theorems

Theory of Recursive Functions and Effective Computability
Luboš Brim's course seems to be based on the book Theory of Recursive Functions and Effective Computability, captured in Wikidata. As per zbmath.org, the book syllabus is this: Recursive Functions. Unsolvable Problems. Purposes; Summary. Recursive Invariance. Recursive and Recursively Enumerable Sets. Reducibilities. One-one Reducibility: Many-one Reducibility; Creative Sets. Truth-table Reducibilities: Simple Sets. Turing Reducibility: Hypersimple Sets. Post's Problem; Incomplete Sets. The Recursion Theorem. Recursively Enumerable Sets as Lattice. Degrees of Unsolvability. The Arithmetical Hierarchy (Part I). Arithmetical Hierarchy (Part II). The Analytical Hierarchy.