Friday, May 18, 2018

Spring 2018 report to the Computer Conservation Society

This was presented on May 17, 2018 to the Computer Conservation Society by Doron Swade.

Work continues on the cross-referenced database for Babbage’s Scribbling Books, the set of manuscript notebooks Babbage used to record his daily deliberations. The database marathon has been undertaken by Tim Robinson in the US and the most recent work takes us to the mid-1860s (Babbage died in 1871). Tim reports that this later content is fragmented and not as systematically referenced by Babbage to the mechanical drawings as is his earlier work. This kicks the interpretative can down the road somewhat as once the transcriptions are complete this content will need to be revisited to integrate it into the larger picture. Page-by-page inspection, while exacting, has the rewards of close reading one of which is revealing new content in the cracks. Here is one such: in the context of manufacturing methods Babbage calculates that the total number of teeth to be formed for a store with 1,000 registers would be 1,800,000.

The Science Museum’s small store at Blythe House has been cleared and a missing Scribbling Book has come to light. A microfiche from the 1970s, illegible in places, was all that was thought to have survived. The Museum generously made the re-found volume available at its excellent viewing facilities in the Dana Centre, South Kensington, and we have photographed the volume using a copying rostrum as an interim measure to resolve by comparison unclear material in the microfiche. The Museum intends to digitise the volume in due course and add it to the online digital archive.

A new development comes in the form of Pip Meadway, a volunteer who has generously been transcribing manuscripts. Using captured digital images of the sources he has transcribed material from the Cambridge Scribbling Book. He is currently working on images of the essays on the Analytical Engine Babbage wrote while travelling in Italy after his memorable visit to a convention in Turin in 1841 where he gave his one and only lecture on the AE designs. The manuscripts are in the Buxton archive in Oxford and the archivists kindly allowed image capture for the transcription work.

Doron Swade

Monday, March 19, 2018

March 2018 report to the Computer Conservation Society

This was presented on March 15, 2018 to the Computer Conservation Society by Doron Swade.

Work continues on the cross-referenced database for Babbage’s Scribbling Books, the set of manuscript notebooks Babbage used to record his daily deliberations.

Our original intention in supporting the wider release by the Science Museum of the Babbage technical archive was to enlist, in due course, the support of a wider community of interested volunteers. Until recently we have not taken up generous offers of help largely because it was not evident how our limited resources could stretch to manage an extended programme of work and to give the new input appropriate attention. A new development has been to make available for transcription by an enthusiastic volunteer images taken of the Scribbling Book held in the Cambridge Library. This trial programme has prompted us to address a number of issues: access to material that is on conditional release to the project by institutional archives; usage rights and access to the database; rights to edit, amend or add material; issues of attribution and checking to maintain the integrity of the content; and the formalisation of editorial conventions for database entries. The experiment has provided a valuable opportunity to address these and related issues in preparation for enlisting wider participation when we return to the task of interpreting the new indexed material to make a final assessment of the designs and the extent to which the material supports a consistent description of a complete machine.

The Cambridge manuscript belongs to Babbage’s later period (1850s and early 1860s) when he returned to refine and develop his earlier work. The most substantial single section consists of some 65 manuscript pages the transcription of which is now complete. Tim Robinson has vetted the transcriptions and incorporated them into the database. Preliminary review of this new material suggests that while cryptic in parts it is more coherent than previously thought and contains some potentially dramatic simplifications of implementation. This material will be the focus of close study in due course.

Doron Swade

Monday, January 22, 2018

Winter 2017 report to the Computer Conservation Society

This was presented on January 18, 2018 to the Computer Conservation Society by Doron Swade.

Work continues compiling the searchable database for Babbage's manuscript Notebooks. This work is being done by Tim Robinson in the US. It has till now been impossible for Babbage scholars to come to definitive conclusions about aspects of the Analytical Engine design because of uncertainty as to what the Notebooks contained: we could not know whether what had already been researched was all that Babbage had to say on any particular topic, nor could we assess the degree of completeness of the designs in ignorance of what else there might be in the some two dozen volumes of his manuscript Notebooks. Digging in the final cracks has been rewarding though we have resisted spending too much time interpreting the content given that the major immediate priority is data capture and cross-indexing. 

The question of the levels of completeness of the various designs is critical to a prospective build and new clues have emerged from the recent work. A manuscript in the Cambridge University Library contains a disconcerting observation by Babbage: that 'when some great improvement arose I only worked out enough to satisfy myself of its truth. I reserved the enquiry into many of its consequences as a treat when I otherwise felt indisposed to work' (1860). This has bleak implications for a definitive detailed design. 

Tim Robinson’s mining of the Notebooks revealed an entry in which Babbage refers to Plan 13 as the 'most complete ever made' (1849). So we now have a datum set by Babbage himself by which to judge the best expectation of completeness and this promises to give us a first approximation of the size and nature of design gaps we might need to fill in the specification of a meaningfully buildable machine. 

Continuing mining the Notebooks for the searchable cross-referenced database remains the priority for the coming months.

Doron Swade

Thursday, November 16, 2017

Autumn 2017 report to the Computer Conservation Society

This was presented on November 16 to the Computer Conservation Society by Doron Swade.

Work has continued steadily going through Babbage’s manuscript Sketchbooks (his working notebooks) and building up the cross reference database. As reported previously the volume of material is substantial and its organisation is not conducive to systematic study: it not indexed or themed by topic, nor is it rigorously chronological. Time and time again Babbage revisits the same or related topics over a period of decades, and these entries, many of which are cryptic, are dispersed through the twenty-five volumes comprising some 7-8,000 manuscript sheets. The cross-referenced database is being developed by Tim Robinson as a key research tool to manage this distributed content. 

The focus for the last six months has been on the volumes most relevant to the Analytical Engine design started in 1834. Happily this main sequence of books is, for the most part, in chronological order. We have just completed Volume 5 which covers 1841–1844, and includes the most intense period of work by Babbage on Plan 28, the most advanced design for the Analytical Engine.

There are notable gaps corresponding to periods when Babbage was travelling. There is a separate "Travelling Scribbling Book", which has not yet been studied in detail, and we know of a significant body of manuscript material in the Buxton archive at Oxford which was written while Babbage was travelling in Europe in the early 1840s. The intention is to fill these gaps in due course. 

While focussing on building the database, we have resisted the temptation analyse the material as we go as such analysis will be substantially assisted once the full corpus is in searchable form. Having said which, there are already new findings. A landmark drawing is Plan 25, dated 5 August 1840, which depicts the "Great Engine". This Plan provides the most complete system overview of the state of play at that time and is the most well-known of Babbage’s technical drawings. The version of the machine in Plan 25 is that Babbage presented in Turin in 1840 and on which Menabrea based his published description, which in turn prompted Ada Lovelace's famous Notes. The new finding is that there is no evidence of "user level" conditional control in this defining version of the design, this despite provision for sophisticated multi-way conditional branching at the "microcode" level. Given that the 1840 version was incapable of user-programmable conditional branching, the machine described in Plan 25 should be regarded technically as a calculator rather than a computer in the modern sense.

The first evidence of user-programmable conditional branching appears in an entry dated 19 March 1842 in what Babbage called the "minor operations" – ascertaining if a variable is zero, and ascertaining if a variable is + or -. This was when Babbage was well into the design of the "Small Analytical Engine" – a reduced version described in Plans 26 and 27. Work on Plan 28 (yet another complete reset) started two months later, but these “minor operations”, essential to making a "universal" machine, were carried over unchanged. It is yet to be established what suddenly triggered the addition of these operations. Babbage himself gives no hint of the reason in the Sketchbooks studied so far. 

Some 2,100 pages have so far been cross referenced, indexed, and transcribed into the database. Though this represents only about a quarter of the total manuscript material, we are much further than a quarter of the way through the process: most of the remaining volumes are more fragmentary, contain material not related to the Analytical Engine, or contain rough drafts later transferred to the drawings and/or the notations (textual content already captured). All the remaining volumes will be worked through though these are not regarded as a priority at this time.

Doron Swade

Tuesday, May 23, 2017

Spring 2017 report to the Computer Conservation Society

Doron Swade gave an update on Plan 28 to the Computer Conservation Society on May 19 as follows:

Excellent progress to report on the database for the Babbage technical archive. Tim Robinson in the US has produced a searchable database of all catalogued material with related content fully cross-referenced. Each item links directly to the corresponding Science Museum catalogue entry and to the recently available (low resolution) online scans of the originals. This work covers all technical drawings and related Notations (there are some 2,200 Notations for the Analytical Engine). A small amount of material that is known to exist but that is not yet in the Science Museum catalogue remains yet to be done.

Back in London I have completed a review of the 26 volumes of Babbage’s Scribbling Books – Babbage’s scratchpad daybooks. The Scribbling Books comprise 8,100 folio sides each of which has been examined for relevant content. The specific purpose of this review was to identify all material specifically relating to the Mechanical Notation, Babbage’s language of signs and symbols that he used to describe and specify his engines. At the same time other content relating to known unresolved questions was logged. The logs are intended as a retrieval and navigation tool to support ongoing research into the notational language with a view to further decoding the Analytical Engine designs.
It is thought to be only the third time in history that the set of Scribbling Books has been gone through in their entirety. The only known precedents for this are the work of the late Bruce Collier, and the late Allan Bromley in the late 1960s and 70s.

The next step on the main database is to systematically go through the Scribbling Books and extract all cross references, tag subject content and transcribe significant material. This process is expected to be completed by the end of the year.

Doron Swade

Friday, January 20, 2017

Winter 2016 report to the Computer Conservation Society

This was presented on January 19 to the Computer Conservation Society by Doron Swade.

The main activities since last report focus on the original manuscript sources of the Babbage technical archive held by the Science Museum. Since the 19 th century there have been several generations of reference systems, and with the digitisation of the archive in 2011 by the Science Museum, a further layer was added. The reference system now used by the Science Museum will be the de facto standard for future scholarship.

What we are doing is reviewing image by image the entire archive holdings (some 7000 manuscript folios) which include all surviving drawings and notations for the Analytical Engine, to reconcile their filenames and titles with the three or four earlier reference systems, to identify anomalies, relate the descriptions to the physical sources for untraced or missing material, identify phantom entries and omissions, and resolve situations in which material is known to exist or have existed for which no physical source is evident. Not all of this is straight forward and in some instances unscrambling layered inconsistent reference systems dating back to Babbage’s time has proved to be nightmarishly difficult. Several visits to the physical archive at Wroughton have been made. More will be required.

The outcome of this process will be a searchable data base, annotated and cross-referenced, that identifies all known sources, and records the status of each source including issues of provenance, anomalous reference history, with a record of links and citations to other material in the archive and elsewhere.

As reported in September, Tim Robinson in the US is going through all known material sheet by sheet to construct the searchable data base with estimated completion by the end of 2017. In London I am going through 20 volumes of Babbage’s ‘Scribbling Books’ page by page, transcribing AE-relevant material, to produce a searchable quick index, estimated for completion by July 2017.

We are in close collaboration with the Science Museum archivists, and our findings are routinely supplied to them in support of their ongoing work to open-source this material. The main outcome to the Analytical Engine project will be a survey-knowledge of all known material relevant to the AE design, consistent indexing, and a powerful software retrieval and reference tool.

While this activity is ongoing we have intermitted our efforts to reverse engineer a more complete understanding of the Analytical Engine design though, it must be said, pursuing the implications of critical new discoveries has proved, on occasions, irresistible.

Doron Swade

Friday, October 7, 2016

How we got to where we are

The recent update on the project reported that we have taken a strategic step away from the nuts and bolts of the mechanical drawings and are concentrating on marshalling all known archival sources that bear on the design of the Analytical Engines in its various forms.

Why we took this step had an unforeseen prompt.

Last year, 2015, marked the 200th anniversary of the birth of Augusta Ada, Countess of Lovelace, who, in 1843, wrote in collaboration with Babbage a much-debated account of the Analytical Engine. The bicentennial year focused attention on Lovelace’s life and work: symposia, colloquia, conferences, exhibitions and publications invited perspectives on the significance of Lovelace’s role. This required amongst other efforts a new and detailed look at her famous article.

A celebrated feature of Lovelace’s article was the inclusion of a description of how an Analytical Engine would automatically calculate Bernoulli numbers. The sequence of instructions, the presentational format of the procedures, and the representation of the changing internal states of the Engine have what we now recognise as program-like features. Nowhere does Lovelace or Babbage use the word ‘program’ but for convenience the procedures she described will continue to be referred to in what follows as ‘programs’ on the understanding that to do so is anachronistic.

The Crunch

Rainer Glaschick in Germany was invited to create a simulation of Lovelace’s Bernoulli example for public display in an exhibition at the Heinz Nixdorf MuseumsForum in Paderborn, Germany, and he embarked on the most detailed analysis to date of the algorithmic and instructional content of the example.

Rainer consulted with several others, Bernard Sufrin in Oxford, Tim Robinson in the US, me in the UK and others, to explore and clarify programming structure, underlying and implicit concepts, and hardware capability.

In the course of this Rainer raised searching questions about the computational requirements of the Bernoulli calculation and this prompted further questions about whether the Analytical Engine as designed by the early 1840s would have been capable of calculating the Bernoulli series as Lovelace described.

What emerged from Rainer’s analysis was a clearer understanding of Lovelace’s program. However, the question of whether or not the Analytical Engine of the early 1840s was capable of executing the calculation, and managing the results, pushed to the limits our understanding of the internal control of the Analytical Engine, specifically the question of the basic control arrangements between the punched cards of which there are several types, the processor (‘the Mill’) and memory (the ‘Store’).

Our inability to definitively answer aspects of the control arrangements was partly what prompted us to change our investigative strategy.

Why is Lovelace’s Bernoulli example so difficult?

A taster of what Rainer’s exploration raised for us was the question of memory management.

The Bernoulli numbers form a series in which each new term is generated by a repeated set of operations.

Instructions are coded on Operation Cards – punched cards that specify the instruction to be performed. Associated with each Operation Card are Variable Cards that indicate where the operand is to be found in the Store, and where in the Store a result is to be placed. The relationship between an Operation Card and its Variable Cards is ‘hardwired’ i.e. the association between them is fixed and unalterable.

The Analytical Engine could automatically wind back the set of Operation Cards and rerun them in a loop a prescribed number of times. Since the Variable Cards contain a form of absolute addressing, rerunning the same physical set of Operation Cards will place each new result in the same location in memory i.e. each new result overwrites each last result and, unless printed as they are generated, intermediate results are lost.
For the Bernoulli calculation all prior results in the series are required for the computation of each new result. So results need to be retained in separate locations in the Store for later systematic retrieval.

Lovelace’s Bernoulli program describes looped iteration that does not overwrite the results register i.e. each new result is placed in a separate incremented location in the Store. Without a form of indexed or relative addressing it is not evident how this could have been done by rerunning the same set of cards and we have found no evidence in the design drawings for a relative or indexed addressing capability. The late Allan Bromley, whose work on the designs is the most detailed and penetrating to date, surmised that this is something that Babbage did not resolve.

One way of automatically computing a recurrent series and retaining all intermediate results would be to repeat the sequence of operations by feeding in physically repeated sets of cards but associate with each set a different Variable Card to direct each new result to a new location in the Store. This would allow automatic calculation of the Bernoulli sequence. But it is clear that Lovelace wished for a general solution as a demonstration of the complete generality of the Analytical Engine’s capabilities – enter n as the number of Bernoulli numbers needed and press ‘Go’ for the automatic generation of all n Bernoulli numbers in the series using the same looped set of Operation Cards.

Between 1837 and 1840 Babbage wrote some two dozen programs at least two of which involve recurrence relationships of this kind i.e. the calculation of series requiring the repetition of the same sequence of operations to generate each next term. In the two main examples each new result is generated only from the immediately prior result, and each new result overwrites its immediate predecessor. So if the nth term of a series is required the instruction set would be repeated n times and prior results, other than the (n-1)th are not material. If the prior intermediate results are needed they can be printed as they are generated, but they do not need to be retained internally in the Store to continue the series. Such recurrence relations can be computed by rerunning the same physical set of Operations and Variable Cards and overwriting each last result with each new one.

So while Babbage had described how the Engine would deal with some recurrence relationships he provided no example of a recurrence relationship that required the internal retention and reuse of all prior results. Without a systematic form of incremental addressing it is unclear that Lovelace’s Bernoulli program could run on an Analytical Engine of the early 1840s. This is part of the reason why Lovelace’s Bernoulli example is a more challenging example than any of Babbage’s earlier examples of programs.

Being unable to definitively resolve the arrangements for memory management in a decisive response to Rainer’s questions prompted us to realign our immediate objectives and to redirect our attentions to systematically master what was knowable about the Analytical Engine design – this by establishing a comprehensive database for all known technical sources, ensure that the database searchable and, perhaps most importantly given Babbage’s sometimes fragmented way of working, to internally cross-reference the material. This is a substantial task given the size of the archive but the outcome will allow a systematic analysis and reveal to what extent existing sources constitute a coherent description of a buildable machine.

Rainer Glaschick has made public his analysis of Lovelace’s Bernoulli example. His full account, Ada Lovelace's Calculation of Bernoulli's Numbers, can be found here.

Doron Swade
October 6, 2016