The axiomatic treatment of the computational complexity of partial recursive functions initiated by Blum is extended to relatively computable functions (as computed, for example, by Turing machines ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback