Oracle machine (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Oracle machine" in English language version.

refsWebsite

Global rank English rank

5worldcat.org

5^th place

4doi.org

2^nd place

4web.archive.org

1^st place

2archive.org

6^th place

2stanford.edu

179^th place

183^rd place

1ucdenver.edu

low place

1cornell.edu

332^nd place

246^th place

1kth.se

low place

8,363^rd place

archive.org

Rogers 1967, p. 129. Rogers, Hartley (1 April 1967). Theory of recursive functions and effective computability. New York: McGraw-Hill. OCLC 559483934.
Soare 1987, p. 47; Rogers 1967, p. 130. Soare, Robert I. (1987). Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic (1st ed.). Springer Berlin, Heidelberg. doi:10.1007/978-3-662-02460-7_3 (inactive 8 November 2024). ISSN 0172-6641.{{cite book}}: CS1 maint: DOI inactive as of November 2024 (link) Rogers, Hartley (1 April 1967). Theory of recursive functions and effective computability. New York: McGraw-Hill. OCLC 559483934.

cornell.edu

cs.cornell.edu

Bennett & Gill 1981, p. 96. Bennett, Charles H.; Gill, John (February 1981). "Relative to a Random Oracle A, P^A != NP^A != co-NP^A with Probability 1" (PDF). SIAM Journal on Computing. 10 (1). doi:10.1137/0210008. ISSN 0097-5397. Archived (PDF) from the original on 25 December 2022.

doi.org

Soare 1987, p. 47; Rogers 1967, p. 130. Soare, Robert I. (1987). Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic (1st ed.). Springer Berlin, Heidelberg. doi:10.1007/978-3-662-02460-7_3 (inactive 8 November 2024). ISSN 0172-6641.{{cite book}}: CS1 maint: DOI inactive as of November 2024 (link) Rogers, Hartley (1 April 1967). Theory of recursive functions and effective computability. New York: McGraw-Hill. OCLC 559483934.
Baker, Gill & Solovay 1975, p. 431. Baker, Theodore; Gill, John; Solovay, Robert (December 1975). "Relativizations of the P=?NP Question" (PDF). SIAM Journal on Computing. 4 (4). doi:10.1137/0204037. ISSN 0097-5397. Archived (PDF) from the original on 19 March 2023. Retrieved 21 October 2023.
Bennett & Gill 1981, p. 96. Bennett, Charles H.; Gill, John (February 1981). "Relative to a Random Oracle A, P^A != NP^A != co-NP^A with Probability 1" (PDF). SIAM Journal on Computing. 10 (1). doi:10.1137/0210008. ISSN 0097-5397. Archived (PDF) from the original on 25 December 2022.
Chang et al. 1994, p. 29. Chang, Richard; Chor, Benny; Goldreich, Oded; Hartmanis, Juris; Håstad, Johan; Ranjan, Desh; Rohatgi, Pankaj (1 August 1994). "The random oracle hypothesis is false" (PDF). Journal of Computer and System Sciences. 49 (1): 24–39. doi:10.1016/S0022-0000(05)80084-4. ISSN 0022-0000.

kth.se

csc.kth.se

Chang et al. 1994, p. 29. Chang, Richard; Chor, Benny; Goldreich, Oded; Hartmanis, Juris; Håstad, Johan; Ranjan, Desh; Rohatgi, Pankaj (1 August 1994). "The random oracle hypothesis is false" (PDF). Journal of Computer and System Sciences. 49 (1): 24–39. doi:10.1016/S0022-0000(05)80084-4. ISSN 0022-0000.

stanford.edu

theory.stanford.edu

Trevisan 2014, p. 2. Trevisan, Luca (16 January 2014). "Notes for Lecture 4" (PDF). CS254: Computational Complexity. Stanford University. Archived (PDF) from the original on 1 April 2014. Retrieved 22 October 2023.
Trevisan 2014, p. 1. Trevisan, Luca (16 January 2014). "Notes for Lecture 4" (PDF). CS254: Computational Complexity. Stanford University. Archived (PDF) from the original on 1 April 2014. Retrieved 22 October 2023.

ucdenver.edu

cse.ucdenver.edu

Baker, Gill & Solovay 1975, p. 431. Baker, Theodore; Gill, John; Solovay, Robert (December 1975). "Relativizations of the P=?NP Question" (PDF). SIAM Journal on Computing. 4 (4). doi:10.1137/0204037. ISSN 0097-5397. Archived (PDF) from the original on 19 March 2023. Retrieved 21 October 2023.

web.archive.org

Baker, Gill & Solovay 1975, p. 431. Baker, Theodore; Gill, John; Solovay, Robert (December 1975). "Relativizations of the P=?NP Question" (PDF). SIAM Journal on Computing. 4 (4). doi:10.1137/0204037. ISSN 0097-5397. Archived (PDF) from the original on 19 March 2023. Retrieved 21 October 2023.
Trevisan 2014, p. 2. Trevisan, Luca (16 January 2014). "Notes for Lecture 4" (PDF). CS254: Computational Complexity. Stanford University. Archived (PDF) from the original on 1 April 2014. Retrieved 22 October 2023.
Trevisan 2014, p. 1. Trevisan, Luca (16 January 2014). "Notes for Lecture 4" (PDF). CS254: Computational Complexity. Stanford University. Archived (PDF) from the original on 1 April 2014. Retrieved 22 October 2023.
Bennett & Gill 1981, p. 96. Bennett, Charles H.; Gill, John (February 1981). "Relative to a Random Oracle A, P^A != NP^A != co-NP^A with Probability 1" (PDF). SIAM Journal on Computing. 10 (1). doi:10.1137/0210008. ISSN 0097-5397. Archived (PDF) from the original on 25 December 2022.

worldcat.org

search.worldcat.org

Rogers 1967, p. 129. Rogers, Hartley (1 April 1967). Theory of recursive functions and effective computability. New York: McGraw-Hill. OCLC 559483934.
Soare 1987, p. 47; Rogers 1967, p. 130. Soare, Robert I. (1987). Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic (1st ed.). Springer Berlin, Heidelberg. doi:10.1007/978-3-662-02460-7_3 (inactive 8 November 2024). ISSN 0172-6641.{{cite book}}: CS1 maint: DOI inactive as of November 2024 (link) Rogers, Hartley (1 April 1967). Theory of recursive functions and effective computability. New York: McGraw-Hill. OCLC 559483934.
Baker, Gill & Solovay 1975, p. 431. Baker, Theodore; Gill, John; Solovay, Robert (December 1975). "Relativizations of the P=?NP Question" (PDF). SIAM Journal on Computing. 4 (4). doi:10.1137/0204037. ISSN 0097-5397. Archived (PDF) from the original on 19 March 2023. Retrieved 21 October 2023.
Bennett & Gill 1981, p. 96. Bennett, Charles H.; Gill, John (February 1981). "Relative to a Random Oracle A, P^A != NP^A != co-NP^A with Probability 1" (PDF). SIAM Journal on Computing. 10 (1). doi:10.1137/0210008. ISSN 0097-5397. Archived (PDF) from the original on 25 December 2022.
Chang et al. 1994, p. 29. Chang, Richard; Chor, Benny; Goldreich, Oded; Hartmanis, Juris; Håstad, Johan; Ranjan, Desh; Rohatgi, Pankaj (1 August 1994). "The random oracle hypothesis is false" (PDF). Journal of Computer and System Sciences. 49 (1): 24–39. doi:10.1016/S0022-0000(05)80084-4. ISSN 0022-0000.