E4. Catalogue of Historical Computer
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Computer Conservation Society
Issue Number 52 Autumn 2010 Computer Conservation Society Aims and objectives The Computer Conservation Society (CCS) is a co-operative venture between the British Computer Society (BCS), the Science Museum of London and the Museum of Science and Industry (MOSI) in Manchester. The CCS was constituted in September 1989 as a Specialist Group of the British Computer Society. It is thus covered by the Royal Charter and charitable status of the BCS. The aims of the CCS are: To promote the conservation of historic computers and to identify existing computers which may need to be archived in the future, To develop awareness of the importance of historic computers, To develop expertise in the conservation and restoration of historic computers, To represent the interests of Computer Conservation Society members with other bodies, To promote the study of historic computers, their use and the history of the computer industry, To publish information of relevance to these objectives for the information of Computer Conservation Society members and the wider public. Membership is open to anyone interested in computer conservation and the history of computing. The CCS is funded and supported by voluntary subscriptions from members, a grant from the BCS, fees from corporate membership, donations, and by the free use of the facilities of both museums. Some charges may be made for publications and attendance at seminars and conferences. There are a number of active Projects on specific computer restorations and early computer technologies and software. -
Computer Conservation Society
Issue Number 88 Winter 2019/20 Computer Conservation Society Aims and Objectives The Computer Conservation Society (CCS) is a co-operative venture between BCS, The Chartered Institute for IT; the Science Museum of London; and the Science and Industry Museum (SIM) in Manchester. The CCS was constituted in September 1989 as a Specialist Group of the British Computer Society. It is thus covered by the Royal Charter and charitable status of BCS. The objects of the Computer Conservation Society (“Society”) are: To promote the conservation, restoration and reconstruction of historic computing systems and to identify existing computing systems which may need to be archived in the future; To develop awareness of the importance of historic computing systems; To develop expertise in the conservation, restoration and reconstruction of historic computing systems; To represent the interests of the Society with other bodies; To promote the study of historic computing systems, their use and the history of the computer industry; To publish information of relevance to these objectives for the information of Society members and the wider public. Membership is open to anyone interested in computer conservation and the history of computing. The CCS is funded and supported by a grant from BCS and from donations. There are a number of active projects on specific computer restorations and early computer technologies and software. Younger people are especially encouraged to take part in order to achieve skills transfer. The CCS also enjoys a close relationship with the National Museum of Computing. Resurrection The Journal of the Computer Conservation Society ISSN 0958-7403 Number 88 Winter 2019/20 Contents Society Activity 2 News Round-Up 9 The Data Curator 10 Paul Cockshott From Tea Shops to Computer Company: The Improbable 15 Story of LEO John Aeberhard Book Review: Early Computing in Britain Ferranti Ltd. -
Latest Results from the Procedure Calling Test, Ackermann's Function
Latest results from the procedure calling test, Ackermann’s function B A WICHMANN National Physical Laboratory, Teddington, Middlesex Division of Information Technology and Computing March 1982 Abstract Ackermann’s function has been used to measure the procedure calling over- head in languages which support recursion. Two papers have been written on this which are reproduced1 in this report. Results from further measurements are in- cluded in this report together with comments on the data obtained and codings of the test in Ada and Basic. 1 INTRODUCTION In spite of the two publications on the use of Ackermann’s Function [1, 2] as a mea- sure of the procedure-calling efficiency of programming languages, there is still some interest in the topic. It is an easy test to perform and the large number of results ob- tained means that an implementation can be compared with many other systems. The purpose of this report is to provide a listing of all the results obtained to date and to show their relationship. Few modern languages do not provide recursion and hence the test is appropriate for measuring the overheads of procedure calls in most cases. Ackermann’s function is a small recursive function listed on page 2 of [1] in Al- gol 60. Although of no particular interest in itself, the function does perform other operations common to much systems programming (testing for zero, incrementing and decrementing integers). The function has two parameters M and N, the test being for (3, N) with N in the range 1 to 6. Like all tests, the interpretation of the results is not without difficulty. -
Short Bios of Attendees Peter Mcburney Is a David Hales Is a Senior Professor of Computer Research Fellow at the Science and Head of the Open University
Short Bios of Attendees Peter McBurney is a David Hales is a senior Professor of Computer research fellow at The Science and Head of the Open University. I do Department of Informatics at research at the overlap King's College London. He is a member of the Agents and between computer Intelligent Systems (AIS) science and social Group of the Department. McBurney's research science. I am interested in focuses on several areas in multi-agent software open distributed systems that include both machine and human agencies where the systems including: agent communications imposition of central control is not an option and languages (ACLs) and protocols; multi-agent one can't rely on the "invisible hands" of simulation models of public policy and corporate orthodox economic (or game) theory. strategy domains; the presence of reflective intelligent entities able to learn, and able Jeffrey Johnson is Professor of themselves to model the environment they are Complexity Science and Design. in; cyber conflict, cyberwar and cyberweapons. I joined the Open University in Seth Bullock is Professor in 1980 after three years as Senior the Agents, Interaction and Research Associate in the Complexity Group and the Geography Department of Cambridge University, and six Institute for Complex Systems years as Research Fellow in the Mathematics Simulation at the University of Department of Essex University. Southampton. My principal research interest is evolutionary simulation modelling: the Jeremy Pitt is Reader in, and, application of evolutionary modelling techniques deputy head of the Intelligent developed within artificial intelligence (e.g., Systems and Networks Group at genetic algorithms) to problems within evolutionary biology (e.g., the evolution of Imperial College. -
Alan Turingturing –– Computercomputer Designerdesigner
AlanAlan TuringTuring –– ComputerComputer DesignerDesigner Brian E. Carpenter with input from Robert W. Doran The University of Auckland May 2012 Turing, the theoretician ● Turing is widely regarded as a pure mathematician. After all, he was a B-star Wrangler (in the same year as Maurice Wilkes) ● “It is possible to invent a single machine which can be used to compute any computable sequence. If this machine U is supplied with the tape on the beginning of which is written the string of quintuples separated by semicolons of some computing machine M, then U will compute the same sequence as M.” (1937) ● So how was he able to write Proposals for development in the Mathematics Division of an Automatic Computing Engine (ACE) by the end of 1945? 2 Let’s read that carefully ● “It is possible to inventinvent a single machinemachine which can be used to compute any computable sequence. If this machinemachine U is supplied with the tapetape on the beginning of which is writtenwritten the string of quintuples separated by semicolons of some computing machinemachine M, then U will compute the same sequence as M.” ● The founding statement of computability theory was written in entirely physical terms. 3 What would it take? ● A tape on which you can write, read and erase symbols. ● Poulsen demonstrated magnetic wire recording in 1898. ● A way of storing symbols and performing simple logic. ● Eccles & Jordan patented the multivibrator trigger circuit (flip- flop) in 1919. ● Rossi invented the coincidence circuit (AND gate) in 1930. ● Building U in 1937 would have been only slightly more bizarre than building a differential analyser with Meccano. -
FEBRUARY 1981 R
THE ISSN 004-8917 AUSTRALIAN COMPUTER JOURNAL VOLUME 13, NUMBER 1, FEBRUARY 1981 r CONTENTS INVITED PAPER 1-6 Software and Hardware Technology for the ICL Distributed Array Processor R.W. GOSTICK ADVANCED TUTORIALS 7-12 On Understanding Binary Search B.P. KIDMAN 13-23 Some Trends in System Design Methodologies I.T. HAWRYSZKIEWYCZ SHORT COMMUNICATIONS 24-25 NEBALL and FINGRP: New Programs for Multiple Nearest- Neighbour Analysis D.J. ABEL and W.T. WILLIAMS 26 Program INVER Revisited D.J. ABEL and W.T. WILLIAMS 27-28 A Comparison between PASCAL, FORTRAN and PL/1 D.J. KEWLEY SPECIAL FEATURES 29 Book Reviews 30-31 Letters to the Editor 32 Call for Papers V J Published for Australian Computer Society Incorporated Registered for Posting as a Publication — Category B “This wouldn't have happened, Fenwick, with a Tandem NonStop™ System," When your computers down, are you out or business? You can bank on it. Timing couldn’t be worse. No question about it. Your busiest season. Customers pounding for service. When you’re on a Tandem NonStop™ System, your information All it takes is one small failure somewhere in the system. One files and your processes are protected from contamination in a disc or disc controller. One input/output channel. way no other system can match. We’ve built in safeguards other For want of an alternative, the system is down and business is suppliers can only dream about. You’ve heard the war stories about lost. Sometimes forever. restart and restore data base on other systems. They’re not exaggerations, but they can be a thing of the past. -
Manchester Baby Simulator Narration
Manchester Baby Simulator Narration By David Sharp The University of Warwick 11th January 2001 Geoff Tootill’s Highest Common Factor program, written in his notebook 19/6/48. Recent background1 Between 1996 and 1998 much research was done by the Manchester Computer Conservation Society in building an accurate replica of the ‘Baby’ (as of 21st June 1948) for its 50th anniversary. A competition was also staged for people to write programs for the ‘Baby’, the winning program was run on the replica on the 21st June 1998. This rebuild of the replica raised the profile of the Baby and also caused a lot of research into details of the machine that might otherwise have been lost to history. Historical accuracy The display presented by the simulator is a stylized version of the original June 1948 Baby. I have made the interface as much like the original as is possible using Java’s GUI capability. Great pains have been taken to provide an accurate rendition of the Baby’s controls and idiosyncrasies. As well as this original interface, I have borrowed from the “player” notion of Martin Campbell-Kelly’s EDSAC simulator (Raul and Hashagen, p. 400) in providing an alternative modern day interface for loading and running the ‘Baby’. The similarities between the original machine and the simulator interface are shown below in Figure 1. It would be easy for someone to learn to operate the original machine from the simulator. Figure 1: The original Baby’s (above), the replica’s (above right) and the simulator’s (right) interfaces. 1 The history and widespread influence of the development of the Baby is outlined in the introduction to the user guide. -
ATLAS@50 Then and Now
ATLAS@50 Then and now Science & Technology Facilities Council The origins of Atlas In the years following the Second World War, there was huge interest in nuclear physics technologies both for civilian nuclear energy research and for military nuclear weapons. These technologies required ever-increasing amounts of computer power to analyse data and, more importantly, to perform simulations far more safely than would be possible in a laboratory. By 1958, 75% of Britain’s R&D computer power was provided by the Atomic Energy Authority (UKAEA) at Aldermaston (using an American IBM 704), Risley, Winfrith and Harwell (each using a British Ferranti Mercury). These were however what we would now call The advisory panel for the super-computer single-user systems, capable of running only included Freddy Williams (a pioneer in radar and Foreword one program at a time, so were essentially very computer technology) from Victoria University large desktop calculators. Indeed, the name of Manchester, Maurice Wilkes (designer of It is now known as Rutherford Appleton Laboratory buildings R26 and R27, but over “computer” referred to the human operator; EDSAC, the Electronic Delay Storage Automatic its 50+ year history, the Atlas Computer Laboratory in the parish of Chilton has been the machinery itself was known as an Calculator) from Cambridge, Albert Uttley of the “automatic calculating machine.” RRE (Royal Radar Establishment), and Ted Cooke- part of many seminal moments in computing history. Yarborough (designer of the Dekatron and CADET British manufacturers of automatic calculating computers) from AERE Harwell; Christopher Over its 50+ year history it has also housed It was cleaned and restored as far as we could, machines were doing well until IBM announced Strachey (a pioneer in programming language many mainframe and super-computers including and took pride of place at an event held to that their first transistorised computer was to design) was in charge of design. -
July 9Th Leader
Navigator browser [Sept 18] America", after the owner of the soon became the industry Seattle business park housing July 9th leader. Nintendo’s US operation, Mario Segale, demanded payment of a Andreessen authored a popular late rental bill. op-ed piece for The Wall Street ICL Formed Journal in August 2011, “Why There is, of course, no donkey in July 9, 1968 Software Is Eating the World”. “Donkey Kong”, so why “donkey”? Miyamoto apparently International Computers wanted to include “donkey” to Limited (ICL) was a large British convey stubbornness. When he computer company created first suggested it, he was through the merger of several laughed at, but the name stuck. companies, including International Computers and Tabulators (ICT [Feb 27]), English Electric Leo Marconi Tron Released (EELM), and Elliott Automation July 9, 1982 [Oct 00]. EELM was itself a merger of the computer Tron (or TRON) is a 1982 sci-fi divisions of English Electric film directed by Steven [May 10], LEO [Sept 5], and Lisberger, and partly inspired by Marconi [Dec 11]. his love of Pong [Nov 29]. Jeff Bridges, a loveably roguish The hope of the UK’s Labour programmer, is transported into Government was that ICL could the nightmarish software world compete with major world of a mainframe. manufacturers like IBM, and for Marc Andreessen (2008). Photo a while it did quite well. by Joi. CC BY 2.0. Tron was one of the first movies to make ‘extensive’ use of Its most successful product line computer animation – about 20 was the ICL 2900 series A 2015 New Yorker piece, minutes worth, CGI was used for announced on October 9, 1974. -
Manchester Baby Simulator Narration
Manchester Baby Simulator Narration By David Sharp The University of Warwick 11th January 2001 Geoff Tootill’s Highest Common Factor program, written in his notebook 19/6/48. Recent background1 Between 1996 and 1998 much research was done by the Manchester Computer Conservation Society in building an accurate replica of the ‘Baby’ (as of 21st June 1948) for its 50th anniversary. A competition was also staged for people to write programs for the ‘Baby’, the winning program was run on the replica on the 21st June 1998. This rebuild of the replica raised the profile of the Baby and also caused a lot of research into details of the machine that might otherwise have been lost to history. Historical accuracy The display presented by the simulator is a stylized version of the original June 1948 Baby. I have made the interface as much like the original as is possible using Java’s GUI capability. Great pains have been taken to provide an accurate rendition of the Baby’s controls and idiosyncrasies. As well as this original interface, I have borrowed from the “player” notion of Martin Campbell-Kelly’s EDSAC simulator (Raul and Hashagen, p. 400) in providing an alternative modern day interface for loading and running the ‘Baby’. The similarities between the original machine and the simulator interface are shown below in Figure 1. It would be easy for someone to learn to operate the original machine from the simulator. Figure 1: The original Baby’s (above), the replica’s (above right) and the simulator’s (right) interfaces. 1 The history and widespread influence of the development of the Baby is outlined in the introduction to the user guide. -
Curriculum Vitae (PDF)
CURRICULUM VITAE JOHNSTON, RONALD JOHN Date of Birth: 30 March 1941 ACADEMIC CAREER 1959-1964 School of Geography, University of Manchester: Wiltshire County Scholarship 1959-1962 B.A. Honours, Class II.I June 1962 State Studentship in Arts 1962-1963 MA June 1964. 1964-1966 Department of Geography, Monash University 1964 Teaching Fellow 1965 Senior Teaching Fellow 1966 Lecturer 1967 PhD 1967-1974 Department of Geography, University of Canterbury 1967-1968 Lecturer 1969-1972 Senior Lecturer 1973-1974 Reader 1974-1992 Department of Geography, University of Sheffield 1974- Professor 1982-5 Head of Department. 1989-1992 Pro-Vice-Chancellor for Academic Affairs, University of Sheffield. 1992-1995 Vice-Chancellor, University of Essex 1995- Professor of Geography, University of Bristol 1999- Adjunct Professor, Department of Human Geography, Macquarie University 2003- Member, Centre for Market and Public Organisation, Department of Economics, University of Bristol AWARDS 1969 Erskine Fellow, University of Canterbury. Fellowship awarded to enable attendance at international conferences in U.S.A. and U.K. and to undertake research in Venezuela, Colombia, Ecuador and Peru. 1972 Visiting Associate Professor, Department of Geography, University of Toronto. 1973 Academic Visitor, Department of Geography, London School of Economics and Political Science. 1973 British Council Commonwealth Academic Interchange Scheme, Travel Fellowship. 1976 Official Overseas Guest, South African Geographical Society Quadrennial Conference, University of Orange Free State, Bloemfontein and Visiting Professor, Department of Geography and Environmental Studies, University of the Witwatersrand, Johannesburg. 1985 Official Conference Guest, Conference of Irish Geographers, Carysfort College, Blackrock, February 1985. 1985 Recipient of the Murchison Award of the Royal Geographical Society, London, for contributions to political geography. -
Principles and Practice of Database Systems Macmillan Computer Science Series Consulting Editor Professor F
Principles and Practice of Database Systems Macmillan Computer Science Series Consulting Editor Professor F. H. Sumner, University of Manchester S. T. Allworth, Introduction to Real-time Software Design Ian O. Angell, A Practical Introduction to Computer Graphics R. E. Berry and B. A. E. Meekings, A Book on C G. M. Birtwistle, Discrete Event Modelling on Simula T. B. Boffey, Graph Theory in Operations Research Richard Bornat, Understanding and Writing Compilers J. K. Buckle, The ICL 2900 Series J. K. Buckle, Software Configuration Management J. C. Cluley, Interfacing to Microprocessors Robert Cole, Computer Communications Derek Coleman, A Structured Programming Approach to Data Andrew J. T. Colin, Fundamentals ofComputer Science Andrew J. T. Colin, Programming and Problem-solving in Algol 68 S. M. Deen, Principles and Practice ofDatabase Systems P. M. Dew and K. R. James, Introduction to Numerical Computation in Pascal M. R. M. Dunsmuir and G. J. Davies, Programming the UNIX System K. C. E. Gee, Introduction to Local Area Computer Networks J. B. Gosling, Design ofArithmetic Units for Digital Computers Roger Hutty, Fortran for Students Roger Hutty, Z80 Assembly Language Programming for Students Roland N. Ibbett, The Architecture ofHigh Performance Computers P. Jaulent, The 68000 - Hardware and Software M. J. King and J. P. Pardoe, Program Design UsingJSP - A Practical Introduction H. Kopetz, Software Reliability , E. V. Krishnamurthy, Introductory Theory ofComputer Science Graham Lee, From Hardware to Software: an introduction to computers A. M. Lister, Fundamentals ofOperating Systems, third edition G. P. McKeown and V. J. Rayward-Smith,Mathematicsfor Computing Brian Meek, Fortran, PL/1 and the Algols Derrick Morris, An Introduction to System Programming - Based on the PDP11 Derrick Morris and Roland N.