An Example of a Theorem that has Contradictory Relativizations and a Diagonalization Proof
| dc.contributor.author | Chang, Richard | en_US |
| dc.date.accessioned | 2007-04-23T17:39:59Z | |
| dc.date.available | 2007-04-23T17:39:59Z | |
| dc.date.issued | 1989-11 | en_US |
| dc.description.abstract | We construct a computable space bound $S(n)$, with $n^{2} less than S(n) less than n^{3}$ and show by diagonalization that DSPACE [$S(n)$] = DSPACE [$S(n)$ log $n$]. Moreover, we can show that there exists an oracle $A$ such that DSPACE [$S(n)$] $\neq$ DSPACE$^{A}$[$S(n)$ log $n$]. This is a counterexample to the belief that is a theorem has contradictory relativizations, then is cannot be proved using standard techniques like diagonalization [7]. | en_US |
| dc.format.extent | 423955 bytes | |
| dc.format.extent | 135677 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1059 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6859 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | An Example of a Theorem that has Contradictory Relativizations and a Diagonalization Proof | en_US |
| dc.type | technical report | en_US |