Relativization of the Theory of Computational Complexity
Name
MIT-LCS-TR-099.pdf
Size
3.16 MB
Format
Adobe PDF
Checksum (MD5)
71c1889e15f7248ce9b4ac0751575dd2
Author(s)
Lynch, Nancy A.
Date Issued
June 1972
Series/Report no.
MIT-LCS-TR-099
MAC-TR-099
Abstract
Blum's machine-independent treatment of the complexity of partial recursive functions is extended to relative algorithms (as represented by Turing machines with oracles). We prove relativizations of several results of Blum complexity theory, such as the compression theorem. A recursive relatedness theorem is proved, showing that any two relative complexity measures are related by fixed recursive function. This theorem allows us to obtain proofs of results for all measures from proofs for a particular measure.
Persistent DSpace Link
