[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

Random-Access Stored-Program Machines, an Approach to Programming Languages

Published: 01 October 1964 Publication History
First page of PDF

References

[1]
NAUR, P. (ED.) Report on the algorithmic language ALGOL 60. Comm. ACM 3, 5 (May 1960), 299-314; and Numer. Math. 2, (1960), 106-136.
[2]
DAvis, M. Computability and Unsolvability. McGraw Hill, New York, 1958.
[3]
HERMES, H. Aufzdhlbarkeit, Entseheidbarkeit, Berechenbarkeit, Einftihrung in die Theorie der Recursiven Funktionen. Berlin, Springer, 1961.
[4]
GOLDSTINE, H, H., AND vONNEUMANN, J. Planning and coding of problems for an electronic computing instrument. Rep. 1947, Inst. Adv. Study, Princeton.
[5]
ASSER, G. Turing-Msschinen und Markowsche Algorithmen. Z. Math. Log. Grundlag. Math. 5 (1959), 346-365.
[6]
KAPHENGST, H. Eine abstrakte programmgesteuerte Rechenmaschine. Z. Math. Log. Grundlag. Math. 5 (1959), 366-379.
[7]
WANG, H. A variant to Turing's theory of computing machines. J. ACM 4, 1 (Jan. 1957), 63-92.
[8]
GILMORE, P. An abstract computer with a LISP-like machine language without a label operator. In Computer Programming and Formal Systems, P. Braffort (Ed.), North Holland, 1963.
[9]
SHEPHERDSON, J. C. AND STURGIS, H. E. Computability of recursive functions. J. ACM 10, 2 (April 1963), 217-255.

Cited By

View all
  • (2022)Abstractions, their algorithms, and their compilersCommunications of the ACM10.1145/349068565:2(76-91)Online publication date: 24-Jan-2022
  • (2021)BSF: A parallel computation model for scalability estimation of iterative numerical algorithms on cluster computing systemsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2020.12.009149(193-206)Online publication date: Mar-2021
  • (2020)Theoretical Computer Science: Computability, Decidability and LogicA Guided Tour of Artificial Intelligence Research10.1007/978-3-030-06170-8_1(1-50)Online publication date: 8-May-2020
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of the ACM
Journal of the ACM  Volume 11, Issue 4
Oct. 1964
130 pages
ISSN:0004-5411
EISSN:1557-735X
DOI:10.1145/321239
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1964
Published in JACM Volume 11, Issue 4

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)96
  • Downloads (Last 6 weeks)5
Reflects downloads up to 05 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2022)Abstractions, their algorithms, and their compilersCommunications of the ACM10.1145/349068565:2(76-91)Online publication date: 24-Jan-2022
  • (2021)BSF: A parallel computation model for scalability estimation of iterative numerical algorithms on cluster computing systemsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2020.12.009149(193-206)Online publication date: Mar-2021
  • (2020)Theoretical Computer Science: Computability, Decidability and LogicA Guided Tour of Artificial Intelligence Research10.1007/978-3-030-06170-8_1(1-50)Online publication date: 8-May-2020
  • (2019)Semantics of Mizar as an Isabelle Object LogicJournal of Automated Reasoning10.1007/s10817-018-9479-z63:3(557-595)Online publication date: 1-Oct-2019
  • (2018)Expressiveness, meanings and machinesComputability10.3233/COM-1800907:4(367-394)Online publication date: 24-Oct-2018
  • (2018)A Perspective View of Discrete Automata and Their DesignThe American Mathematical Monthly10.1080/00029890.1965.1197070772:sup2(125-134)Online publication date: 5-Feb-2018
  • (2014)A theoretical formalism for analyzing agent-based modelsComplex Adaptive Systems Modeling10.1186/2194-3206-2-32:1(3)Online publication date: 2014
  • (2014)ReferencesTheory of Computational Complexity10.1002/9781118595091.refs(458-479)Online publication date: 13-Jun-2014
  • (2013)Detecting Traditional Packers, DecisivelyProceedings of the 16th International Symposium on Research in Attacks, Intrusions, and Defenses - Volume 814510.1007/978-3-642-41284-4_10(184-203)Online publication date: 23-Oct-2013
  • (2013)BibliographyTheory of Computational Complexity10.1002/9781118032916.biblio(453-473)Online publication date: 6-Dec-2013
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media