Professional Documents
Culture Documents
Full download The Mathematical Artist: A Tribute To John Horton Conway Sukanta Das file pdf all chapter on 2024
Full download The Mathematical Artist: A Tribute To John Horton Conway Sukanta Das file pdf all chapter on 2024
Full download The Mathematical Artist: A Tribute To John Horton Conway Sukanta Das file pdf all chapter on 2024
https://ebookmass.com/product/field-guide-to-optics-education-a-
tribute-to-john-greivenkamp-j-scott-tyo/
https://ebookmass.com/product/a-tribute-to-emil-wolf-first-
edition-edition-visser/
https://ebookmass.com/product/godling-the-dragonrider-heritage-
book-4-nicole-conway/
https://ebookmass.com/product/das-duell-john-milton-7-german-
edition-dawson/
Governance Dilemmas in Canada, North America, and
Beyond: A Tribute to Stephen Clarkson Michèle Rioux
https://ebookmass.com/product/governance-dilemmas-in-canada-
north-america-and-beyond-a-tribute-to-stephen-clarkson-michele-
rioux/
https://ebookmass.com/product/das-revier-john-milton-11-german-
edition-mark-dawson/
https://ebookmass.com/product/a-mathematical-approach-to-marxian-
value-theory-dong-min-rieu/
https://ebookmass.com/product/beginning-c23-7th-edition-ivor-
horton-2/
https://ebookmass.com/product/beginning-c23-7th-edition-ivor-
horton/
Emergence, Complexity and Computation ECC
Sukanta Das
Souvik Roy
Kamalika Bhattacharjee Editors
The Mathematical
Artist
A Tribute To John Horton Conway
Emergence, Complexity and Computation
Volume 45
Series Editors
Ivan Zelinka, Technical University of Ostrava, Ostrava, Czech Republic
Andrew Adamatzky, University of the West of England, Bristol, UK
Guanrong Chen, City University of Hong Kong, Hong Kong, China
Editorial Board
Ajith Abraham, MirLabs, USA
Ana Lucia, Universidade Federal do Rio Grande do Sul, Porto Alegre, Rio Grande
do Sul, Brazil
Juan C. Burguillo, University of Vigo, Spain
Sergej Čelikovský, Academy of Sciences of the Czech Republic, Czech Republic
Mohammed Chadli, University of Jules Verne, France
Emilio Corchado, University of Salamanca, Spain
Donald Davendra, Technical University of Ostrava, Czech Republic
Andrew Ilachinski, Center for Naval Analyses, USA
Jouni Lampinen, University of Vaasa, Finland
Martin Middendorf, University of Leipzig, Germany
Edward Ott, University of Maryland, USA
Linqiang Pan, Huazhong University of Science and Technology, Wuhan, China
Gheorghe Păun, Romanian Academy, Bucharest, Romania
Hendrik Richter, HTWK Leipzig University of Applied Sciences, Germany
Juan A. Rodriguez-Aguilar , IIIA-CSIC, Spain
Otto Rössler, Institute of Physical and Theoretical Chemistry, Tübingen, Germany
Vaclav Snasel, Technical University of Ostrava, Czech Republic
Ivo Vondrák, Technical University of Ostrava, Czech Republic
Hector Zenil, Karolinska Institute, Sweden
The Emergence, Complexity and Computation (ECC) series publishes new devel-
opments, advancements and selected topics in the fields of complexity, computa-
tion and emergence. The series focuses on all aspects of reality-based computation
approaches from an interdisciplinary point of view especially from applied sciences,
biology, physics, or chemistry. It presents new ideas and interdisciplinary insight on
the mutual intersection of subareas of computation, complexity and emergence and
its impact and limits to any computing based on physical limits (thermodynamic and
quantum limits, Bremermann’s limit, Seth Lloyd limits…) as well as algorithmic
limits (Gödel’s proof and its impact on calculation, algorithmic complexity, the
Chaitin’s Omega number and Kolmogorov complexity, non-traditional calculations
like Turing machine process and its consequences,…) and limitations arising in arti-
ficial intelligence. The topics are (but not limited to) membrane computing, DNA
computing, immune computing, quantum computing, swarm computing, analogic
computing, chaos computing and computing on the edge of chaos, computational
aspects of dynamics of complex systems (systems with self-organization, multiagent
systems, cellular automata, artificial life,…), emergence of complex systems and its
computational aspects, and agent based computation. The main aim of this series is
to discuss the above mentioned topics from an interdisciplinary point of view and
present new ideas coming from mutual intersection of classical as well as modern
methods of computation. Within the scope of the series are monographs, lecture
notes, selected contributions from specialized conferences and workshops, special
contribution from international experts.
Indexed by zbMATH.
Kamalika Bhattacharjee
Department of Computer Science
and Engineering
National Institute of Technology
Tiruchirappalli, India
© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature
Switzerland AG 2022
This work is subject to copyright. All rights are solely and exclusively licensed by the Publisher, whether
the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse
of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and
transmission or information storage and retrieval, electronic adaptation, computer software, or by similar
or dissimilar methodology now known or hereafter developed.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
The publisher, the authors and the editors are safe to assume that the advice and information in this book
are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or
the editors give a warranty, expressed or implied, with respect to the material contained herein or for any
errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional
claims in published maps and institutional affiliations.
This Springer imprint is published by the registered company Springer Nature Switzerland AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
John Horton Conway
December 26, 1937–April 11, 2020
[Image Courtesy: Denise Applewhite, Princeton Office of Communications, Princeton University]
Preface
The beginning of the year 2020 had seen the sudden appearance of an unknown virus,
named as SARS-CoV-2, which caused Coronavirus disease (COVID-19) and started
wreaking havoc over the globe within a few months, resulting in a pandemic. The
world literally stalled under this wrath of nature. This was the time when we lost
John Horton Conway.
Who is John Conway to us? We are the students, researchers, and practitioners of
Cellular Automata (CAs). All of us were practically introduced to cellular automaton
(CA) through the Game of Life by our teachers. This Game of Life, sometimes simply
known as Life, is a zero-player game developed by John Conway in 1970. Although
historically CA was initiated by John von Neumann and Stanislaw Ulam in the 1940s,
it was Conway’s Game of Life which popularized CA to the people beyond academia.
The power of its simple rule to create an infinite world of possible complex patterns
is bound to make everyone like us charmed and intrigued to know more about CAs
and advertently come to do research on CAs.
However, John Conway was not limited to only Game of Life. In fact, it is a
very small shade of his life filled with contributions in different areas forming a
colorful palette. Be it the Combinatorial game theory, Group theory, Number theory,
Geometry, Geometric topology, Algebra, or Theoretical Physics, whatever area he
had touched, a remarkable contribution on his name has remained there. We lost the
legacy of this math luminary on Saturday, April 11, 2020, in New Brunswick, New
Jersey, USA, from complications related to COVID-19.
Nevertheless, civilization cannot be stopped by a pandemic. It created a new
normal situation—the use of online meetings to continue work from home. Classes,
meetings, conferences, etc. were finally resumed in virtual mode. During this time
(August 2020), we, some of the Indian researchers on cellular automata, took an
initiative to create a virtual platform where the people doing research in different
shades of Theoretical Computer Science, especially on Cellular Automata, can get to
know each other’s work, participate and interact in lively discussions on a common
platform. In this discourse, we started Series of Webinars on Cellular Automata
where eminent scientists over the globe in the field of theoretical computer science,
in general, and cellular automata, in particular, joined us in enlightening dialogues.
vii
viii Preface
We would like to take this opportunity to express our deep gratitude to Prof. Mihir
K. Chakraborty who first encouraged us to take this initiative. We also thank our small
team of cellular automata researchers—Supreeti Kamilya, Sumit Adak, Sukanya
Mukherjee, Raju Hazari, Nazma Naskar, Debopriya Barman, and Biswanath Sethi
as well as the Cellular Automata India community as a whole without whose support
this book would have remained only in dreams.
John Horton Conway was a legendary mathematician who was distinguished for his
love of games and for bringing mathematics to the common people. He was one
of the most multifaceted mathematicians of the past century, a wizard, polymath,
storyteller, and a natural problem-solver whose unaided accomplishments often made
his colleagues spell-bound.
Conway became renowned during his stay at Cambridge University (as a student
and professor from 1957 to 1987). However, he claimed to never have worked a single
day in his life. Instead, “he purported to have frittered away reams and reams of time
doing nothing, being lazy, playing games”. Yet he was Princeton University’s pres-
tigious John von Neumann Professor in Applied and Computational Mathematics
since 1987 which position he held until 2013 when he was transferred to emeritus
status.
Conway received the Berwick Prize in 1971 and the Pólya Prize in 1987 (first
recipient). He was awarded the Nemmers Prize in Mathematics (1998) and the Leroy
P. Steele Prize for Mathematical Exposition of the American Mathematical Society
in 2000. He was elected as a Fellow of the Royal Society (1981), and Fellow of the
American Academy of Arts and Sciences (1992). For his contributions, he received
honorary degrees from the University of Liverpool in 2001 and Alexandru Ioan
Cuza University in 2014 and honorary membership of the British Mathematical
Association in 2017.
Known for his playful approach, swift computation, and natural problem-solving
skills, John Horton Conway has been called a “magical genius”. For several years, he
fretted that his obsession with playing silly games was wasting his career—until he
recognized, it could steer astounding discoveries! His fascination with games gave
birth to a theory of partisan games—combinatorial game theory, which he originated
with Elwyn Berlekamp and Richard Guy. The famous book series Winning Ways for
your Mathematical Plays is an outcome of this collaboration. In fact, his book On
Numbers and Games (1976) gives the mathematical foundations of this theory. He
also developed and analyzed many other puzzles and games, such as Conway’s
soldiers, peg solitaire, Soma cube, and philosopher’s football.
xi
xii John Horton Conway
“Conway was a remarkable man. He made his own rules, and lived by them. He almost
never answered letters or emails, and rarely even read them. In the 35 years between the
time he left Cambridge, and his death, he replied to *one* of my emails. And that was only
because, after nearly 30 years of effort, I had finally “solved” a problem he had told me was
impossible.
He never talked about cellular automata. If someone mentioned the subject, he dismissed it
as history, no longer interesting. He delighted in doing the opposite of what was expected.
When introduced to someone at a party who was a mathematician, he is supposed to have
said “I was no good at mathematics at school” which is probably both true and the ultimate
put-down.
I don’t know what it is you want from me, but I can imagine that it may not be quite what
I can provide. I can tell you very little about Conway, but what he taught me about how to
approach problems, and how to ensure that you are in charge, not the problem, has never left
me.” – Robert Wilson
Sukanta Das
Souvik Roy
Kamalika Bhattacharjee
Contents
Invited Articles
Some Notes About the Game of Life Cellular Automaton . . . . . . . . . . . . . . 93
Genaro J. Martínez, Andrew Adamatzky, and Juan C. Seck-Tuoh-Mora
Gliders in the Game of Life and in a Reversible Cellular Automaton . . . 105
Kenichi Morita
From Multiple to Single Updates Per Cell in Elementary Cellular
Automata with Neighbourhood Based Priority . . . . . . . . . . . . . . . . . . . . . . . 139
Pedro Paulo Balbi, Thiago de Mattos, and Eurico Ruivo
Game of Life, Athenian Democracy and Computation . . . . . . . . . . . . . . . . 159
Sukanta Das
Algorithmic Information Dynamics of Cellular Automata . . . . . . . . . . . . . 171
Hector Zenil and Alyssa Adams
The Game of Life in Three Dimensions, and Other Tessellations . . . . . . . 191
Carter Bays
xv
Contributors
xvii
xviii Contributors
Robert Wilson
1 A Personal Remembrance
I really only knew Conway for about 11 years from when I went to Cambridge as
a student in 1975 to when he (Conway) left Cambridge to go to Princeton in 1986.
So I’ll just say a few words about how I interacted with him in those 11 years. Of
course as an undergraduate student, I went to his lectures, I didn’t talk to him, or
interact directly with him but I went to a course he gave in the first year, which was
an optional course, no exams, on formal logic and set theory. And then in the second
year he gave a course called Algebra III, on things like—linear maps1 and quadratic
forms2 —things like that. And what I most remember about it, was the revision notes
that he provided for this course. At the end of the course, he handed out to every
member of the audience one sheet of paper. That one sheet of paper contained the
entire course including all proofs, all the examples, everything, the entire course. It
was typed on two sides of one sheet of paper and had everything in it. He worked a
lot really to get 24 lectures on to one piece of paper. And I think what inspired me
most to work with him is mostly the fourth year course he gave on sporadic simple
1 Inmathematics, a linear map (also called a linear mapping, linear transformation, vector space
homomorphism, or in some contexts linear function) is a mapping V → W between two vector
spaces that preserves the operations of vector addition and scalar multiplication.
2 In mathematics, a quadratic form is a polynomial with terms all of degree two (“form” is another
R. Wilson (B)
Queen Mary University of London, London, UK
e-mail: r.a.wilson@qmul.ac.uk
groups.3 Which was really exactly what I wanted to do, as I found it so fascinating
that I knew, I wanted to do that.
“At the end of the course, he handed out to every member of the audience one sheet of paper.
That one sheet of paper contained the entire course including all proofs, all the examples,
everything, the entire course. It was typed on two sides of one sheet of paper and had
everything in it. He worked a lot really to get 24 lectures on to one piece of paper.”
Then at the end of the fourth year, it’s a very brutal system in Cambridge, they
have the exam which is absolutely brutal. Every separate exam has three questions—
the first question is ‘write out everything in the first eight lectures of the course’; the
second question is ‘write out everything in the second eight lectures of the course’;
and the last question is ‘write out everything in the last eight lectures of the course’.
And you got three hours to do this. And at the end of this you were ranked, and the
first however many people it is, however many places they’ve got, the first so many
people can do a Ph.D. in Cambridge.
I had thought there is no way I’m going to have done well enough, but I was
‘just’ lucky enough. I was, I think, in the very bottom of the list. The same day you
have to go and find a supervisor. So I went to Conway and I said would you be my
supervisor. I want to do sporadic groups. And he said, well you know I am not a
group theorist. And then he tried other ways of putting me off by saying well you
know many of my students never finish their Ph.D.’s. So we had a bit of a discussion
and eventually he agreed to take me on as his student. And when I started, he gave
me a few things to read which were not about group theory at all, they were all
about lattices. And I read several recent papers on lattices. And eventually I found
some groups, the lattices took me towards the groups. And they took me towards
the quaternionic reflection groups,4 in particular the Hall–Janko group.5 Just one of
the sporadic groups and it is contained in the Conway group6 which is related to the
Leech lattice.7 So that’s how I went towards another version of Leech lattice—the
3 In group theory, a sporadic group is one of the 26 exceptional groups found in the classification of
finite simple groups. A simple group is a group G that does not have any normal subgroups except
for the trivial group and G itself. The classification theorem states that the list of finite simple groups
consists of 18 countably infinite families plus 26 exceptions that do not follow such a systematic
pattern. These 26 exceptions are the sporadic groups. They are also known as the sporadic simple
groups, or the sporadic finite groups. Because it is not strictly a group of Lie type, the Tits group is
sometimes regarded as a sporadic group, in which case there would be 27 sporadic groups.
4 It is a group of linear transformations in a quaternionic vector space of dimension n < ∞ generated
quaternionic version of the Leech lattice. And so I studied that. That was what my
first paper8 was about, the group theory associated to this quaternionic Leech lattice.
Then I thought, well if there is a real Leech lattice and a complex Leech lattice, and
two different quaternionic Leech lattices, what about the octonionic Leech lattice?
what about Cayley numbers?9 I did lots of calculations and nothing worked. And
Conway said “it’s impossible”. You can’t do octonionic lattices, because they are not
associative, so there is no linear algebra, there is no lattice, nothing you can do, it’s
impossible.
Well, let me tell you another thing about Conway’s attitude towards problems.
Many supervisors will say you should work on an easy problem and on a hard
problem. So if you can’t solve the hard problem, at least you’ve got the easy problem
for backup. Conway said you should have four problems—you should have one easy
problem and one hard problem. You should also have a trivial problem. So if you
can’t do the easy problem, you can still do the trivial problem. And you should have
one impossible problem. Because if you get really lucky and you solve the impossible
problem then you’ve really made it. So you should have the four problems—from
trivial to impossible. In fact, I think, that was the version of few years before, I
perhaps got a later version that he has expanded this to six problems—you should
have, as well as trivial—easy—hard—impossible problems, you should also have
moderately easy and moderately hard in between. And he really put this into practice.
He was always working on six different things at the same time. And making work,
yes, making progress on most of them—not necessarily always the impossible ones.
“Conway said you should have four problems - you should have one easy problem and one
hard problem. You should also have a trivial problem. So if you can’t do the easy problem,
you can still do the trivial problem. And you should have one impossible problem. Because
if you get really lucky and you solve the impossible problem then you’ve really made it.”
So anyway, what I mean is how versatile he was. I didn’t make progress on the
impossible problem of an octonionic Leech lattice. And it took me 20 years, then
eventually I succeeded, working out how it had to work. At that point I thought, that
was I think in 2009, and so I thought I’d better contact Conway and tell him about
this. Now of course, Conway didn’t have an email address that he read. I mean, he
got thousands and thousands of emails, that he couldn’t possibly keep a count. So,
Leech (1967). It may also have been discovered (but not published) by Ernst Witt in 1940. The
Leech lattice ∧24 is the unique lattice in 24-dimensional Euclidean space, E24 , with the following
list of properties:
• It is unimodular; i.e., it can be generated by the columns of a certain 24 × 24 matrix with
determinant 1.
• It is even; i.e., the square of the length of each vector in ∧24 is an even integer.
• The length of every non-zero vector in ∧24 is at least 2.
8The quaternionic lattice for 2G 2 (4) and its maximal subgroups, J. Algebra, 77 (1982), 449–466.
9There are two completely different definitions of Cayley numbers. The first and most commonly
encountered type of Cayley number is the eight elements in a Cayley algebra, more commonly
known as octonions. A quantity which describes a Del Pezzo surface is sometimes also called a
Cayley number.
6 R. Wilson
anyhow, he had a secret account. So what I did was this—I emailed the office in the
Princeton mathematics department to say—‘I’ve got something really exciting to tell
Conway, I think, he will really be interested, can you forward this email him’. So,
they did. And the next day, I got reply from Conway saying in capital letters—“I
think that is FANTASTIC”. So it took me twenty years but I got there in the end.
So, anyway, let’s perhaps go back to my Ph.D. and how I was working with
Conway for the Ph.D. I told you, he gave me these papers and said read them.
He never gave me a problem. He might have done eventually but I found my own
problems. I said about this quaternionic Leech lattice. I said I worked on the maximal
subgroup problem. The breakthrough came when, at some point in my third year I
think, Conway went on sabbatical for a month or two. He didn’t tell me before he
went he was going away. So I had a month without a supervisor. And, that’s the
time I started having talk to other people and I talked to Simon Norton and John
Thompson. And they gave me some ideas, that I was missing. So they enabled me to
actually study the Leech lattice in a deeper way than I had before and to understand
the maximal subgroups10 problem in a deeper way and make progress. And then I
eventually managed to get a postdoc after my Ph.D. I suppose the other thing that
really helped me to get a job was that I worked on the ‘Atlas of finite groups’ which
was a project that Conway started probably about 10 years before with Robert Curtis.
And getting my name on the front of that book11 was very important for my career.
What else should I say, probably I should not say so much about myself more about
Conway.
As I said I went to many of his lecture courses. And he often gave the impression,
the lectures were not prepared because he talked as though he was just talking to you
in a cafe or something. He wouldn’t talk as if he was reading a prepared script of
the lectures. And often he would say well—we could do it like this, we could do it
like that, which do you want—things like this. And later on when he gave research
seminars to audiences he would say I’ve got six talks which one do you want me to
give. And eventually I realized that it wasn’t that the talks were not prepared. They
were very well prepared. But they weren’t written down. They were prepared in his
head. And so, because they were in his head, they vary slightly from one performance
to another just like a piece of music might. Sometimes he would go off in a different
direction or do things differently and so on. He’d play the music in a different way.
That was what gave the impression of it being spontaneous. When it really wasn’t.
I just made a mistake at one point of thinking that it is possible to give lectures like
this without preparation. I very quickly found that it was not. It is quite possible to
10 In group theory, a maximal subgroup H of a group G is a proper subgroup, such that no proper
subgroup K contains H strictly. In other words, H is a maximal element of the partially ordered
set of subgroups of G that are not equal to G. Maximal subgroups are of interest because of their
direct connection with primitive permutation representations of G. They are also much studied for
the purposes of finite group theory.
11 “Atlas of finite groups” by JH Conway, RT Curtis, SP Norton, RA Parker and RA Wilson; Oxford
The great idea of using a single lead screw for various pitches, by
means of change gears, was Maudslay’s own. Fig. 16 shows how
rapidly the idea was developed.[38] This machine, built about 1800, is
distinctly modern in appearance. It has a substantial, well-designed,
cast-iron bed, a lead screw with 30 threads to the inch, a back rest
for steadying the work, and was fitted with 28 change wheels with
teeth varying in number from 15 to 50. The intermediate wheel had a
wide face and was carried on the swinging, adjustable arm in order
to mesh with wheels of various diameters on the fixed centers.
Sample screws having from 16 to 100 threads per inch are shown on
the rack in front. Both of these lathes are now in the South
Kensington Museum in London. With lathes of this design, Maudslay
cut the best screws which had been made up to that time. One of
these was 5 feet long, 2 inches in diameter, with 50 threads to the
inch, and the nut fitted to it was 12 inches long, thus engaging 600
threads. “This screw was principally used for dividing scales for
astronomical and other metrical purposes of the highest class. By its
means divisions were produced with such minuteness that they
could only be made visual by a microscope.”[39]
[38] No. 1602 in South Kensington Museum, London. Cat. M. E.
Collection, Part II, pp. 266-267.
[39] “Autobiography of James Nasmyth,” p. 140. London, 1883.
About 1797
Figure 16. Maudslay’s Screw-Cutting Lathe
About 1800
Maudslay’s record, as left behind him in steel and iron, would give
him a secure place in engineering history, but his influence as a
trainer of men is quite as great. He loved good work for its own sake
and impressed that standard on all in his employ. Clement, Roberts,
Whitworth, Nasmyth, Seaward, Muir and Lewis worked for him, and
all showed throughout their lives, in a marked way, his influence
upon them. Other workmen, whose names are not so prominent,
spread into the various shops of England the methods and standards
of Maudslay & Field (later Maudslay, Sons & Field) and made
English tool builders the leaders of the world for fifty years.
J. G. Moon, who afterwards became manager of James Watt &
Company of Soho, the successor of Boulton & Watt, was
apprenticed to Maudslay, Sons & Field and gives the following
picture of the shop at the zenith of its prosperity.
There were not more than perhaps a dozen lathes in use there, with cast-iron
box beds such as we now know; but nearly all the lathes had been constructed by
the firm itself and were made without a bed, the poppet or back center and the
slide-rest being supported on a wrought-iron triangular bar, varying in size from,
say, 3-in. to 6-in. side. This bar was supported on cast-iron standards, and
reached from the fixed lathe head to the length required of the “bed.” If the lathes
were self-acting, there were two such triangular bars with the guide screw running
between them. The advantage of these lathes was great, for if a large chuck job
was on hand, the bars could be withdrawn from the fixed head, supported on
standards, and anything that would miss the roof or swing in a pit beneath could
be tackled.
There was one screwing machine or lathe which all apprentices in the vice loft
(as the fitting shop in which the writer was apprenticed was called) had to work
during their curriculum—this was a small double-bar lathe with a guide screw
between. The fixed head was on the right of the operator, and the lathe was
worked by hand by means of a wheel very much like a miniature ship’s steering
wheel. This wheel was about 2-ft. diameter, with handles round the rim, and we
apprentices were put at this machine to develop the muscles of the right arm. The
advantages of having the fixed head on the right (instead of on the left, as in an
ordinary lathe) was that in cutting a right-hand thread the tool receded away from
the start and ran off the end, and thus prevented a “root in,” which might happen if,
whilst pulling at the wheel, you became absorbed in the discussion of the abilities
of a music-hall “star” or other equally interesting topics with a fellow-apprentice.
The writer remembers using a pair of calipers at that time, whose “points” were
about ¹⁄₂ in. wide for measuring over the tops of a thread. These were stamped “J.
Whitworth, 1830,” and formerly belonged to the great screw-thread reformer.
Nearly all the bar lathes were driven by gut bands, and one can remember gut
bands of 1-in. diameter being used.
Most of the planing machines were made and supplied by Joseph Whitworth &
Co., and the tool boxes were of the “Jim Crow” type, which used to make a half-
turn round by means of a cord when the belt was shifted at the end of each stroke,
thus cutting each way. The forerunner of this used to interest the writer—a
machine in the vice loft that was variously called a shaping machine and a planing
machine. It was driven by means of a disc about 3-ft. diameter, with a slot down
the disc for varying the stroke. A connecting rod from the disc to the tool box
completed this portion of the machine. The tool box was supported and kept true
by two cylindrical bars or guides on each side, so that the whole arrangement was
like the crosshead of an engine worked by disc and connecting rod. On the top of
the tool box was fixed a toothed sector of a wheel, and at the end of each stroke
this sector engaged with a rack, and in this way the tool box took a half-turn and
was ready for cutting on the return stroke. The writer understands that it was from
this machine that Whitworth developed his “Jim Crow” tool box.
There was also a huge shaping machine, whose stroke was anything up to
about 6 ft., which was simply a tool box fixed on the end of a large triangular bar of
about 12-in. side with the “V” downwards. To the back of the bar was attached a
rack, and this, gearing with a pinion, gave the motion. It was a great fascination to
watch this ponderous bar with its tool box slowly coming forward out of its casing
and taking immense cuts.
Another machine tool that also used to interest the writer was a machine for
turning the crank pins of very large solid cranks, the crank pins being about 18-in.
to 20-in. diameter, and the crank shafts about 24-in. to 30-in. diameter. These
immense crank shafts used to be set in the center of the machine, and the tool
would travel round the crank pin until the work was completed, the feed being
worked by means of a ratchet actuated by leaden weights falling to and fro as the
machines slowly revolved.[46]
[46] Junior Institution of Engineers, pp. 167-168. London, 1914.
By 1840 the design of the planer had become fairly well settled
and its use general. In America, planers were built by Gay, Silver &
Company of North Chelmsford, Mass., as early as 1831. Pedrick &
Ayer of Philadelphia are also said to have built a planer at about the
same time. The early American tool builders will be taken up in a
later chapter.
Little is known of the personalities and histories of some of these
men, such as Spring of Aberdeen. Spring’s name is mentioned by
Smiles in his “Industrial Biography”[53] as one of the inventors of the
planer, but no further reference is made to him.
[53] p. 223.