Next: Notation Up: HIERARCHIES OF GENERALIZED KOLMOGOROV Previous: Introduction and Outline

Preliminaries

Subsections

Notation
Turing Machines: Monotone TMs (MTMs), General TMs (GTMs), Enumerable Output Machines (EOMs)
Infinite Computations, Convergence, Formal Describability
Formally Describable Functions
Weak Decidability and Convergence Problem

Juergen Schmidhuber 2003-02-13