Editing Oracle machine (section)

==References==
===Footnotes===
{{reflist|30em}}
===Sources===
{{refbegin|30em|indent=yes}}
* {{Cite book |last=Adachi |first=Akeo |title=Foundations of computation theory |date=1990 |publisher=Ohmsha |isbn=978-4-274-02190-9 |location=Tokyo}}
* {{Cite journal |last1=Baker |first1=Theodore |last2=Gill |first2=John |last3=Solovay |first3=Robert |author-link3=Robert M. Solovay |date=December 1975 |title=Relativizations of the P=?NP Question |url=https://cse.ucdenver.edu/~cscialtman/complexity/Relativizations%20of%20the%20P=NP%20Question%20(Original).pdf |url-status=live |journal=SIAM Journal on Computing |language=en |volume=4 |issue=4 |doi=10.1137/0204037 |issn=0097-5397 |archive-url=https://web.archive.org/web/20230319210201/https://cse.ucdenver.edu/~cscialtman/complexity/Relativizations%20of%20the%20P=NP%20Question%20(Original).pdf |archive-date=2023-03-19 |access-date=2023-10-21}}
* {{Cite journal |last1=Bennett |first1=Charles H. |author-link=Charles H. Bennett (physicist) |last2=Gill |first2=John |date=February 1981 |title=Relative to a Random Oracle A, P<sup>A</sup> != NP<sup>A</sup> != co-NP<sup>A</sup> with Probability 1 |url=https://www.cs.cornell.edu/courses/cs682/2006sp/Handouts/BennettGill.pdf |url-status=live |journal=SIAM Journal on Computing |language=en |volume=10 |issue=1 |doi=10.1137/0210008 |issn=0097-5397 |archive-url=https://web.archive.org/web/20221225225731/https://www.cs.cornell.edu/courses/cs682/2006sp/Handouts/BennettGill.pdf |archive-date=2022-12-25}}
* {{Cite book |last=Börger |first=Egon |title=Computability, complexity, logic |date=1989 |publisher=North-Holland |isbn=978-0-444-87406-1 |series=Studies in logic and the foundations of mathematics |location=Amsterdam |author-link=Egon Börger}}
* {{Cite journal |last1=Chang |first1=Richard |last2=Chor |first2=Benny |author-link2=Benny Chor |last3=Goldreich |first3=Oded |author-link3=Oded Goldreich |last4=Hartmanis |first4=Juris |author-link4=Juris Hartmanis |last5=Håstad |first5=Johan |author-link5=Johan Håstad |last6=Ranjan |first6=Desh |last7=Rohatgi |first7=Pankaj |date=1994-08-01 |title=The random oracle hypothesis is false |url=http://www.csc.kth.se/%7Ejohanh/randomoracle.pdf |journal=Journal of Computer and System Sciences |volume=49 |issue=1 |pages=24–39 |doi=10.1016/S0022-0000(05)80084-4 |issn=0022-0000 |doi-access=free}}
* {{Cite book |url=http://archive.org/details/undecidablebasic0000mart |title=The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions |date=1965-04-01 |publisher=Raven Press |isbn=978-0-911216-01-1 |editor-last=Davis |editor-first=Martin |editor-link=Martin Davis (mathematician) |location=Hewlett, New York |access-date=2023-10-21 |url-access=registration}}
* {{Cite book |last=Papadimitriou |first=Christos |title=Computational complexity |date=30 November 1993 |publisher=Addison-Wesley |isbn=978-0-201-53082-7 |location=Reading, Massachusetts |author-link=Christos Papadimitriou}}
* {{Cite book |last=Rogers |first=Hartley |url=http://archive.org/details/theoryofrecursiv00roge |title=Theory of recursive functions and effective computability |date=1 April 1967 |publisher=McGraw-Hill |location=New York |oclc=559483934 |author-link=Hartley Rogers, Jr. |url-access=registration}}
* {{Cite book |last=Sipser |first=Michael |title=Introduction to the theory of computation |publisher=PWS Publishing |year=1997 |isbn=978-0-534-94728-6 |location=Boston |oclc=300459879 |author-link=Michael Sipser}}
* {{Cite book |last=Soare |first=Robert I. |title=Recursively Enumerable Sets and Degrees |publisher=Springer Berlin, Heidelberg |year=1987 |edition=1st |series=Perspectives in Mathematical Logic |doi=10.1007/978-3-662-02460-7_3 |doi-broken-date=8 November 2024 |issn=0172-6641 |author-link=Robert I. Soare}}
* {{Cite web |last=Trevisan |first=Luca |author-link=Luca Trevisan |date=16 January 2014 |title=Notes for Lecture 4 |url=https://theory.stanford.edu/~trevisan/cs254-14/lecture04.pdf |archive-date=1 April 2014 |series=CS254: Computational Complexity |publisher=Stanford University |archive-url=https://web.archive.org/web/20140401153746/https://theory.stanford.edu/~trevisan/cs254-14/lecture04.pdf |access-date=22 October 2023 |url-status=live}}
* {{Cite thesis |last=Turing |first=Alan |title=Systems of Logic Based on Ordinals |date=1939 |degree=PhD |publisher=Princeton University |url=https://pure.mpg.de/rest/items/item_2403325_2/component/file_2403324/content |doi=10.1112/plms/s2-45.1.161 |author-link=Alan Turing |id={{ProQuest|301792588}} |hdl=21.11116/0000-0001-91CE-3 |hdl-access=free |archive-url=https://web.archive.org/web/20200313073511/https://pure.mpg.de/rest/items/item_2403325_2/component/file_2403324/content |archive-date=13 March 2020 |url-status=live}} 
* {{Cite book |last=van Melkebeek |first=Dieter |url=http://link.springer.com/10.1007/3-540-44545-5 |title=Randomness and Completeness in Computational Complexity |date=29 June 2003 |publisher=Springer Berlin Heidelberg |isbn=978-3-540-44545-6 |series=Lecture Notes in Computer Science |volume=1950 |language=en |doi=10.1007/3-540-44545-5 |s2cid=27442913 |issn=1611-3349 |oclc=48909425 |url-access=subscription}}
{{refend}}
[[Category:Computability theory]]
[[Category:Turing machine]]
[[Category:Computation oracles|*]]