Jump to ContentJump to Main Navigation
Alan Turing's Automatic Computing EngineThe Master Codebreaker's Struggle to build the Modern Computer$
Users without a subscription are not able to see the full content.

B. Jack Copeland

Print publication date: 2005

Print ISBN-13: 9780198565932

Published to Oxford Scholarship Online: January 2008

DOI: 10.1093/acprof:oso/9780198565932.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 06 December 2019

Notes on memory (1945)

Notes on memory (1945)

Chapter:
(p.455) 21 Notes on memory (1945)
Source:
Alan Turing's Automatic Computing Engine
Author(s):

Alan M. Turing

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198565932.003.0022

This chapter presents fragments from Turing's draft of ‘Proposed Electronic Calculator’. This material is of interest chiefly because of its remarks concerning the universal machine of Turing's 1936 paper ‘On Computable Numbers’. In 1947, Turing described electronic stored-programme digital computers as ‘practical versions of the universal machine’ and it is clear that in designing the ACE, his aim was to replace the paper tape of the universal machine with a practical form of memory for holding instructions and data, and to replace the abstract ‘scanner’ of the universal machine by a ‘central pool of electronic equipment’.

Keywords:   Alan M. Turing, reports, On Computable Numbers, Proposed Electronic Calculator

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .