Sign In

Login

Password

Forgot Password ? Sign Up

Register machine (English Wikipedia)

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

refsWebsite
Global rank English rank
4doi.org
2nd place
2nd place
1wikidata.org
43rd place
161st place
1web.archive.org
1st place
1st place
1jstor.org
26th place
20th place
1wikipedia.org
low place
low place
1wiley.com
222nd place
297th place
1archive.org
6th place
6th place
1pdmi.ras.ru
low place
low place

archive.org (Global: 6th place; English: 6th place)

  • Minsky, Marvin (1967). Computation: Finite and Infinite Machines (1st ed.). Englewood Cliffs, New Jersey, USA: Prentice-Hall, Inc. p. 214. In particular see chapter 11: Models Similar to Digital Computers and chapter 14: Very Simple Bases for Computability. In the former chapter he defines "Program machines" and in the later chapter he discusses "Universal Program machines with Two Registers" and "...with one register", etc.

doi.org (Global: 2nd place; English: 2nd place)

  • Melzak, Zdzislaw Alexander [at Wikidata] (September 1961). "An Informal Arithmetical Approach to Computability and Computation". Canadian Mathematical Bulletin. 4 (3): 89, 279–293 [89, 281, 288, 290–292]. doi:10.4153/CMB-1961-031-9. The manuscript was received by the journal on 15 May 1961. Melzak offers no references but acknowledges "the benefit of conversations with Drs. R. Hamming, D. McIlroy and V. Vyssotsky of the Bell Telephone Laboratories and with Dr. H. Wang of Oxford University." [1]
  • Minsky, Marvin (1961). "Recursive Unsolvability of Post's Problem of 'Tag' and Other Topics in Theory of Turing Machines". Annals of Mathematics. 74 (3): 437–455 [438, 449]. doi:10.2307/1970290. JSTOR 1970290.
  • Lambek, Joachim (September 1961). "How to Program an Infinite Abacus". Canadian Mathematical Bulletin. 4 (3): 295–302 [295]. doi:10.4153/CMB-1961-032-6. The manuscript was received by the journal on 15 June 1961. In his Appendix II, Lambek proposes a "formal definition of 'program'. He references Melzak (1961) and Kleene (1952) Introduction to Metamathematics.
  • Shepherdson, J. C.; Sturgis, H. E. (1963). "Computability of Recursive Functions". Journal of the ACM. 10 (2): 217–255 [218, 219, 245ff, 246]. doi:10.1145/321160.321170. received December 1961 An extremely valuable reference paper. In their Appendix A the authors cite 4 others with reference to "Minimality of Instructions Used in 4.1: Comparison with Similar Systems".

jstor.org (Global: 26th place; English: 20th place)

pdmi.ras.ru (Global: low place; English: low place)

logic.pdmi.ras.ru

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

  • Melzak, Zdzislaw Alexander [at Wikidata] (September 1961). "An Informal Arithmetical Approach to Computability and Computation". Canadian Mathematical Bulletin. 4 (3): 89, 279–293 [89, 281, 288, 290–292]. doi:10.4153/CMB-1961-031-9. The manuscript was received by the journal on 15 May 1961. Melzak offers no references but acknowledges "the benefit of conversations with Drs. R. Hamming, D. McIlroy and V. Vyssotsky of the Bell Telephone Laboratories and with Dr. H. Wang of Oxford University." [1]

wikidata.org (Global: 43rd place; English: 161st place)

  • Melzak, Zdzislaw Alexander [at Wikidata] (September 1961). "An Informal Arithmetical Approach to Computability and Computation". Canadian Mathematical Bulletin. 4 (3): 89, 279–293 [89, 281, 288, 290–292]. doi:10.4153/CMB-1961-031-9. The manuscript was received by the journal on 15 May 1961. Melzak offers no references but acknowledges "the benefit of conversations with Drs. R. Hamming, D. McIlroy and V. Vyssotsky of the Bell Telephone Laboratories and with Dr. H. Wang of Oxford University." [1]

wikipedia.org (Global: low place; English: low place)

de.wikipedia.org

  • Kaphengst, Heinz [de], "Eine Abstrakte Programmgesteuerte Rechenmaschine", Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (1959), 366–379. [2]

wiley.com (Global: 222nd place; English: 297th place)

onlinelibrary.wiley.com

  • Kaphengst, Heinz [de], "Eine Abstrakte Programmgesteuerte Rechenmaschine", Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (1959), 366–379. [2]