Generalized Turing Machines
Monotone TM (MTM): output bits fix
Generalized TM (GTM): can rewrite output tape (compare Burginís inductive TMs). Why?
Because some things are compactly describable on nonhalting GTMs but not on MTMs. GTMs are non-plus-ultra of constructive computability. Compare computability in the limit: Gold, Freyvald, Putnam.
Back to J. Schmidhuber's Theory of Everything page