This is a preview. Log in through your library . Abstract The recursion theorem in abstract partially ordered algebras, such as operative spaces and others, is the most fundamental result of algebraic ...

This course gives an introduction to the mathematical foundations of computation. The course will look at Turing machines, universal computation, the Church-Turing thesis, the halting problem and ...

Description: The theory of general purpose programming systems. Recursive and partial-recursive functions; recursive and recursively enumerable sets. The Church-Turing thesis. The recursion theorem, ...

This course gives an introduction to the mathematical foundations of computation. The course will look at Turing machines, universal computation, the Church-Turing thesis, the halting problem and ...