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 (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 13 April 2021

The Pilot ACE: from concept to reality

The Pilot ACE: from concept to reality

(p.223) 11 The Pilot ACE: from concept to reality
Alan Turing's Automatic Computing Engine

Robin A. Vowels

Oxford University Press

This chapter discusses the development of the Pilot ACE, including the architecture, programming, and performance. The Pilot ACE was a general purpose computer of the serial type, with a clock frequency of 1 MHz. The word size was 32 bits, and dual arithmetic units were provided. One arithmetic unit supported 32-bit numbers (about 9 decimal digits), while the other was for 64-bit numbers (about 19 decimal digits). The 64-bit accumulator was also capable of functioning as two independent 32-bit accumulators. The Pilot ACE had Hollerith 80-column punch-card input and output equipment, the input device running at 200 cards per minute and the output device at 100 cards per minute.

Keywords:   Pilot ACE, computing, computer, programming, architecture

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 .