Computability: Logical and Recursive Complexity
Abstract
The basis of this short course of 4 lectures is the strong analogy between programs and proofs (of their specifications). The main theme is the classification of computable number theoretic functions according to the logical complexity of their formal specification or termination proofs. A significant sub-branch of mathematical logic has grown around this time since the 1950's and new ideas are presently giving rise to further developments. The methods employed are chiefly those from proof theory, particularly normalization as presented in the lectures of H. Schwichtenberg, and ordinal assignments. Since program termination corresponds to well foundedness of computation trees, it is hardly surprising that transfinite ordinals and their constructive representations play a crucial role, measuring the logical complexity of programs and of the functions which they compute.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 06, 1989
- Accession Number
- ADA213963
Entities
People
- Stanley S. Wainer
Organizations
- University of Leeds