计算理论 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "计算理论" in Chinese language version.

refsWebsite

Global rank Chinese rank

2^nd place

23^rd place

6^th place

4^th place

18^th place

57^th place

2semanticscholar.org

11^th place

332^nd place

1web.archive.org

1^st place

1^st place

1videolectures.net

low place

low place

1turingarchive.org

low place

low place

26^th place

113^th place

archive.org (Global: 6^th place; Chinese: 4^th place)

Andrew Hodges. Alan Turing: The Enigma (THE CENTENARY EDITION). Princeton University Press. 2012. ISBN 978-0-691-15564-7.
Donald Monk. Mathematical Logic. Springer-Verlag. 1976. ISBN 9780387901701.

doi.org (Global: 2^nd place; Chinese: 23^rd place)

Chomsky, N. Three models for the description of language. IEEE Transactions on Information Theory. 1956, 2 (3): 113–124. Bibcode:1956IRTIT...2..113C. S2CID 19519474. doi:10.1109/TIT.1956.1056813.
Alan Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society (IEEE). 1937, 2 (42): 230–265 [6 January 2015]. Bibcode:1937PLMS...42..230T. S2CID 73712. doi:10.1112/plms/s2-42.1.230.
Henry Gordon Rice. Classes of Recursively Enumerable Sets and Their Decision Problems. Transactions of the American Mathematical Society (American Mathematical Society). 1953, 74 (2): 358–366. JSTOR 1990888. doi:10.2307/1990888 .

harvard.edu (Global: 18^th place; Chinese: 57^th place)

ui.adsabs.harvard.edu

Chomsky, N. Three models for the description of language. IEEE Transactions on Information Theory. 1956, 2 (3): 113–124. Bibcode:1956IRTIT...2..113C. S2CID 19519474. doi:10.1109/TIT.1956.1056813.
Alan Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society (IEEE). 1937, 2 (42): 230–265 [6 January 2015]. Bibcode:1937PLMS...42..230T. S2CID 73712. doi:10.1112/plms/s2-42.1.230.

jstor.org (Global: 26^th place; Chinese: 113^th place)

Henry Gordon Rice. Classes of Recursively Enumerable Sets and Their Decision Problems. Transactions of the American Mathematical Society (American Mathematical Society). 1953, 74 (2): 358–366. JSTOR 1990888. doi:10.2307/1990888 .

semanticscholar.org (Global: 11^th place; Chinese: 332^nd place)

api.semanticscholar.org

Chomsky, N. Three models for the description of language. IEEE Transactions on Information Theory. 1956, 2 (3): 113–124. Bibcode:1956IRTIT...2..113C. S2CID 19519474. doi:10.1109/TIT.1956.1056813.
Alan Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society (IEEE). 1937, 2 (42): 230–265 [6 January 2015]. Bibcode:1937PLMS...42..230T. S2CID 73712. doi:10.1112/plms/s2-42.1.230.

turingarchive.org (Global: low place; Chinese: low place)

Alan Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society (IEEE). 1937, 2 (42): 230–265 [6 January 2015]. Bibcode:1937PLMS...42..230T. S2CID 73712. doi:10.1112/plms/s2-42.1.230.

videolectures.net (Global: low place; Chinese: low place)

Rabin, Michael O. Turing, Church, Gödel, Computability, Complexity and Randomization: A Personal View. June 2012 [2017-01-17]. （原始内容存档于2019-06-05）.

web.archive.org (Global: 1^st place; Chinese: 1^st place)

Rabin, Michael O. Turing, Church, Gödel, Computability, Complexity and Randomization: A Personal View. June 2012 [2017-01-17]. （原始内容存档于2019-06-05）.