Linked e-resources

Details

Mathematical Background; a Review
A Theory of Computability
Primitive Recursive Functions
Loop Programs.-The Ackermann Function
(Un)Computability via Church's Thesis
Semi-Recursiveness
Yet another number-theoretic characterisation of P
Godel's Incompleteness Theorem via the Halting Problem
The Recursion Theorem
A Universal (non-PR) Function for PR
Enumerations of Recursive and Semi-Recursive Sets
Creative and Productive Sets Completeness
Relativised Computability
POSSIBILITY: Complexity of P Functions
Complexity of PR Functions
Turing Machines and NP-Completeness.

Browse Subjects

Show more subjects...

Statistics

from
to
Export