This chapter provides an accessible and straightforward tour through some of the most basic notions and remarkable phenomena in machine-independent computational complexity. It includes versions of the recursion, compression, speedup, gap, union, and honesty theorems. Where possible, the results are derived from machine-dependent ones, in the particularly… (More)
Figures and Tables
Sorry, we couldn't extract any figures or tables for this paper.