אורקל (מדעי המחשב) – הבדלי גרסאות
תוכן שנמחק תוכן שנוסף
עיצוב |
מ בוט החלפות: – |
||
שורה 14:
* C. H. Bennett, J. Gill. ''Relative to a Random Oracle A, P<sup>A</sup> != NP<sup>A</sup> != co-NP<sup>A</sup> with Probability 1''. SIAM Journal on Computing, 10(1): 96-113 (1981)
* Egon Börger. "Computability, Complexity, Logic". North-Holland, 1989.
* Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Hastad, Desh Ranjan, Pankaj Rohatgi. The Random Oracle Hypothesis is False. ''Journal of Computer and System Sciences'', volume 49, issue 1, pp.
* [[Martin Davis]], editor: ''The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions'', Raven Press, New York, 1965. Turing's paper is in this volume. Papers include those by Gödel, Church, Rosser, Kleene, and Post.
* C. Papadimitriou. ''Computational Complexity''. Addison-Wesley, 1994. Section 14.3: Oracles, pp.
* Hartley Rogers, Jr., ''Theory of Recursive Functions and Effective Computability'', McGraw-Hill, 1967.
* [[Michael Sipser]]. ''Introduction to the Theory of Computation''. PWS Publishing, 1997. {{isbn|0-534-94728-X}}. Section 9.2: Relativization, pp.
* Robert I. Soare, ''Recursively Enumerable Sets and Degrees'', Perspectives in Mathematical Logic, Springer, 1987.
* Alan Turing, ''Systems of logic based on ordinals'', Proc. London math. soc., '''45''', 1939
| |||