A salute to Charles Hamblin

This short biography of Australian philosopher and computer scientist Charles L. Hamblin was initially commissioned by the Australian Computer Museum Society.

Charles Leonard Hamblin (1922-1985) was an Australian philosopher and one of Australia’s first computer scientists. His main early contributions to computing, which date from the mid 1950s, were the development and application of reverse polish notation and the zero-address store. He was also the developer of one of the first computer languages, GEORGE. Since his death, his ideas have become influential in the design of computer interaction protocols, and are expected to shape the next generation of e-commerce and machine-communication systems.

Hamblin was born in 1922 and attended North Sydney Boys’ High School and Geelong Grammar. He then took degrees in Arts (Philosophy and Mathematics) and in Science (Physics), followed by an MA in Philosophy (First Class Honours) at Melbourne University, with his studies interrupted by work as a radar officer in the RAAF during World War II. Following the war, he gained a PhD at the London School of Economics, University of London on the topic, “Language and the Theory of Information”, apparently under Karl Popper (Hamblin 1957a). Hamblin’s thesis presented a critique of Shannon’s theory of information from a semantic perspective, and developed a possible-worlds semantics for question-response exchanges. Between 1955 and his death in 1985 he was a Lecturer and Professor in the School of Philosophy at New South Wales University of Technology (NSWUT), which later became the University of New South Wales (UNSW).

In 1956, the University purchased a DEUCE computer manufactured by the English Electric Company (EEC), an early British computer manufacturer, and Hamblin, with his radar background, became involved in working with this machine. This was the second academic computer in Australia, after that of the University of Sydney. Hamblin soon became aware of the problems of (a) computing mathematical formulae containing brackets, and (b) the memory overhead in having dealing with memory stores each of which had its own name. One solution to the first problem was Jan Lukasiewicz’s Polish notation, which enables a writer of mathematical notation to instruct a reader the order in which to execute the operations (e.g. addition, multiplication, etc) without using brackets. Polish notation achieves this by having an operator (+, *, etc) precede the operands to which it applies, e.g., +ab, instead of the usual, a+b. Hamblin, with his training in formal logic, knew of Lukasiewicz’s work.

However, this does not solve the second problem. Hamblin realized that placing the operation symbol to the right of the operands (i.e., reversing the polish notation, as in ab+) would enable the machine to make use of a store which did not require an address – the current operation would always be conducted on the most-recent operands inserted and still remaining in the store. This store came to be called a stack, or last-in, first-out (LIFO) store. He implemented these ideas in a programming language for the DEUCE machine, a language he called GEORGE, for General Order Generator. This work was undertaken at a time when there were only a handful of programming languages, and indeed still some resistance to the idea of non-assemblor languages (due to their greater memory requirements). Hamblin’s work on the DEUCE machine at UNSW overlapped with that of Gordon Bell and Bob Brigham, who wrote a symbolic assembler and run-time system called SODA (or Symbolic Optimum DEUCE Assembly Program) (Brigham and Bell 1959). GEORGE used the SODA runtime library.

Hamblin presented his work at the first Australian conference on computing, which was held at the Weapon Research Establishment in Salisbury, South Australia, in June 1957 (Hamblin 1957b). Employees of the English Electric Company were present at this conference, and took his ideas back to England. As a consequence, Hamblin’s architecture was implemented in the company’s next machine, which came to be called the KDF9. The architecture of this machine even used Hamblin’s terminology. This machine was announced in 1960 and delivered (i.e. made available commercially) in 1963. Hamblin published his ideas in 1957 (Hamblin 1957b, 1957c) and 1962 (Hamblin 1962). An earlier paper (Burks et al. 1954) presented the same ideas in a more general notational framework, and that paper was briefly reviewed in the Journal of Symbolic Logic in 1955 (Nelson 1955). Hamblin may have seen the Burks paper, or (with greater probability) the JSL review, although neither of these articles is cited in his 1962 Computer Journal paper which presents RPN (Hamblin 1962). (When accessed on 2010-07-20, the catalogue of the Library of the University of New South Wales indicated that the UNSW Library did not currently carry the journal in which the Burks paper was published, Mathematical Tables and Other Aids to Computation; of course, the Library may have carried this journal in the past.)

Another computer, the American Burroughs B5000, announced in 1961 and delivered in 1963, also used a zero-address architecture, and also enabled reverse polish notation to be used for programming. R. S. Barton, one of the designers of the B5000, has written that he developed RPN independently of Hamblin, sometime in 1958 while reading a textbook on symbolic logic, and before he was aware of Hamblin’s work (Barton 1970). A decade after Hamblin first published his ideas, engineers at Hewlett-Packard (HP) developed a personal calculator, the 9100A Desktop Calculator, which used RPN. This calculator, the first in a long line by HP, was released in 1968, and it popularized RPN among the scientific and engineering communities; note, however, that early advertisements for the 9100A did not mention RPN.

Even if Hamblin’s work on RPN was not the first to be published that applied Polish Notation to a computational domain, people at the  time thought it was, as evidenced by the refereed publication of his 1962 paper in the Computer Journal, and Barton’s comments published in 1970.   Hamblin’s contribution to computer science was also recognized with an obituary in the Australian Computer Journal (Allen 1985) and in an influential history of British computing (Lavington 1980). In addition, GEORGE is listed in Bill Kinnersley’s comprehensive directory of computer languages, The Language List. In the 1960s, Hamblin also worked on implementing Tarski’s decision method for real closed fields (Tarski 1951), the first order theory of real numbers with addition and multiplication, and hired two programmers to assist in this project, Malcolm Newey and Vaughan Pratt. However, only in 1974 was it shown by Fischer and Rabin (1974) that the running time of this problem had an exponential lower bound.

Although usually not credited, Hamblin was the originator of two other ideas which subsequently became important in Artificial Intelligence. Firstly, Hamblin appears to have been the first person to define a formal measure of plausibility, distinct from that of probability, in a paper published in 1959. Alternative formalisms for uncertainty have come to play a very important role in Artificial Intelligence, particularly in the design of knowledge-based systems, due to the failure of the standard Kolmogorov axioms of probability to adequately account for all forms of uncertainty and for its manipulation. One person particularly taken by Hamblin’s work in this area was the British economist, George Shackle, who in the 1940s and 1950s had developed a theory of decision-making under uncertainty based on the potential surprise of rival uncertain beliefs, and focusing on the best-case and worst-case outcomes of alternative decision-options (see pp. 97 – 100 of Shackle 1969). (Shackle’s theory, based on his real-world experience of government economic policy making and business investment decisions, differed from the Maximum Expected Utility theory of Leonard J. Savage which has unfortunately come to dominate mainstream economics.)

Secondly, Hamblin was the first person to propose an axiomatic account of time based on intervals, rather than points. This was in a paper published in 1969. An interval calculus for time was later proposed by James Allen (1984), and has been influential in AI, both as a basis for reasoning about time, and, when extended to multiple dimensions, as a basis for reasoning about space (Anger and Rodriguez 1991).

From the 1960s, Hamblin returned to work in philosophy, particularly the philosophy of argumentation, and wrote two very influential books. One of these, Fallacies, published in 1970, is a study of the classical logical fallacies, such as begging the question, which Hamblin examined by means of formal dialogue games. These are games between speakers who utter statements according to strict rules, and they were first studied by Aristotle. Being rule-governed, these games have gained the attention of computer scientists, and, from about 1989, they have been applied in a number of areas, including: natural language processing; human-machine interaction; the design of complex software; and for dialogues between autonomous software agents (McBurney and Parsons 2009). Interaction and communication protocols based on formal dialogue games are likely to form the basis for the next generation of e-commerce systems and systems supporting high-level machine-to-machine communications. Another of Hamblin’s books, Imperatives, published posthumously in 1987, has also been influential in recent work in computer science, in modeling and implementing delegation of tasks between software agents (Atkinson et al. 2008, Reed and Norman 2007, Norman and Reed 2010).

Hamblin was fluent in several languages, including ancient Greek and Latin. He was one of three fellow-students from his time at Geelong Grammar to become professors of philosophy (the others being David Armstrong and Michael Scriven). At the time of his death, he was apparently attempting to set text of Wittgenstein to music.

Charles Hamblin was a pioneer computer scientist and a prominent philosopher, whose influence on the subject is still being felt. His contributions to applied and theoretical computing show the deep links which Computer Science has had, and continues to have, with philosophy and logic.

References:

In addition to the works cited in the text above, I have also listed all of Hamblin’s publications known to me.

J. F. Allen [1984]: Towards a general theory of action and time. Artificial Intelligence, 23(2): 123-154.

M. W. Allen [1985]: Charles Hamblin (1922-1985). The Australian Computer Journal, 17(4): 194-195.

F. D. Anger and R. V. Rodriguez [1991]: Time, tense, and relativity revisited. In: B. Bouchon-Meunier, R. R. Yager and L. A. Zadeh (Editors): Uncertainty in Knowledge Bases: Proceedings of the Third International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 1990), pp. 286-295. Heidelberg, Germany: Springer.

K. Atkinson, R. Girle, P. McBurney and S. Parsons [2008]: Command dialogues. In: I. Rahwan and P. Moraitis (Editors): Proceedings of the Fifth International Workshop in Argumentation in Multi-Agent Systems (ArgMAS 2008). AAMAS 2008, Lisbon, Portugal.

R. S. Barton [1970]: Ideas for computer systems organization: a personal survey. pp. 7-16 of: J. S. Jou (Editor): Software Engineering: Volume 1: Proceedings of the Third Symposium on Computer and Information Sciences held in Miami Beach, Florida, December 1969. New York, NY, USA: Academic Press.

R. C. Brigham and C. G. Bell [1959]: A Translation Routine for the DEUCE Computer. The Computer Journal, 2 (2): 76-84.

A. W. Burks, D. W. Warren and J. B. Wright [1954]: An analysis of a logical machine using paranthesis-free notation. Mathematical Tables and Other Aids to Computation, 8 (46): 53-57.

M. J. Fischer and M. O. Rabin [1974]: Super-exponential complexity of Pressburger arithmetic. Complexity of Computation, AMS-SIAM Proceedings. 7: 27-41.

R. J. Gillings and C. L. Hamblin [1964]: Babylonian reciprocal tables on UTECOM. Technology, 9 (2): 41-42, August 1964. An expanded version appeared in Australian Journal of Science, 27, 1964.

C. L. Hamblin [1957a]: Language and the Theory of Information. PhD Thesis, Logic and Scientific Method Programme, University of London, London, UK. Submitted October 1956, awarded 1957.  Available online or in printed format from the British Library’s Electronic Thesis Online Service, here (registration required).

C. L. Hamblin [1957b]: An addressless coding scheme based on mathematical notation. Proceedings of the First Australian Conference on Computing and Data Processing, Salisbury, South Australia: Weapons Research Establishment, June 1957.

C. L. Hamblin [1957c]: Computer Languages. The Australian Journal of Science, 20: 135-139. Reprinted in The Australian Computer Journal, 17(4): 195-198 (November 1985).

C. L. Hamblin [1957d]: Review of: W. R. Ashby: Introduction to Cybernetics. Australasian Journal of Philosophy, 35.

C. L. Hamblin [1958a]: Questions. Australasian Journal of Philosophy, 36(3): 159-168.

C. L. Hamblin [1958b]: Review of: Time and Modality, by A. N. Prior. Australasian Journal of Philosophy, 36: 232-234.

C. L. Hamblin [1958c]: Surprises, innovations and probabilities. Proceedings of the ANU Symposium on Surprise, Canberra, July 1958.

C. L. Hamblin [1958d]: Review of: Formal Analysis of Normative Systems, by A. R. Anderson. Australasian Journal of Philosophy, 36.

C. L. Hamblin [1958e]: GEORGE Programming Manual. Duplicated, 1958. Revised and enlarged, 1959.

C. L. Hamblin [1959]: The Modal “Probably”. Mind, New Series, 68: 234-240.

C. L. Hamblin [1962]: Translation to and from Polish notation. Computer Journal, 5: 210-213.

C. L. Hamblin [1963]: Questions aren’t statements. Philosophy of Science, 30(1): 62-63.

C. L. Hamblin [1964a]: Has probability any foundations? Proceedings of the Symposium on Probability of the Statistical Society of New South Wales, May 1964. Reproduced in Science Yearbook, University of New South Wales, Sydney, 1964.

C. L. Hamblin [1964b]: Review of: Communication: A Logical Model, by D. Harrah. Australasian Journal of Philosophy, 42.

C. L. Hamblin [1964c]: Review of: Analysis of Questions, by N. D. Belnap.Australasian Journal of Philosophy, 42.

C. L. Hamblin [1965]: Review of: A Preface to the Logic of Science, by P. Alexander. The British Journal for the Philosophy of Science, 15(60): 360-362.

C. L. Hamblin [1966]: Elementary Formal Logic, a Programmed Course. (Sydney: Hicks Smith). Republished by Methuen, in London, UK, 1967. Also translated into Swedish by J. Mannerheim, under the title: Element”ar Logik, ein programmerad kurs. (Stockholm: Laromedelsf”orlagen, 1970).

C. L. Hamblin [1967a]: One-valued logic. Philosophical Quarterly, 17: 38-45.

C. L. Hamblin [1967b]: Questions, logic of. Encyclopedia of Philosophy. (New York: Collier Macmillan).

C. L. Hamblin [1967c]: An algorithm for polynomial operations. Computer Journal, 10.

C. L. Hamblin [1967d]: Review of: New Approaches to the Logical Theory of Interrogatives, by L. Aqvist. Australasian Journal of Philosophy, 44.

C. L. Hamblin [1969]: Starting and stopping. The Monist, 53: 410-425.

C. L. Hamblin [1970a]: Fallacies. London, UK: Methuen.

C. L. Hamblin [1970b]: The effect of when it’s said. Theoria, 36: 249-264.

C. L. Hamblin [1971a]: Mathematical models of dialogue. Theoria, 37: 130-155.

C. L. Hamblin [1971b]: Instants and intervals. Studium Generale, 24: 127-134.

C. L. Hamblin [1972a]: You and I. Analysis, 33: 1-4.

C. L. Hamblin [1972b]: Quandaries and the logic of rules. Journal of Philosophical Logic, 1: 74-85.

C. L. Hamblin [1973a]: Questions in Montague English. Foundations of Language, 10: 41-53.

C. L. Hamblin [1973b]: A felicitous fragment of the predicate calculus. Notre Dame Journal of Formal Logic. 14: 433-446.

C. L. Hamblin [1974]: La logica dell’iniziare e del cessare. Italian translation by C. Pizzi of an unpublished article: The logic of starting and stopping. Pages 295-317 in: C. Pizzi (Editor): La Logica del Tempo. Torino: Bringhieri.

C. L. Hamblin [1975a]: Creswell’s colleague TLM. Nous, 9(2): 205-210.

C. L. Hamblin [1975b]: Saccherian arguments and the self-application of logic. Australasian Journal of Philosophy, 53: 157-160.

C. L. Hamblin [1976]: An improved “Pons Asinorum”? Journal of the History of Philosophy, 14: 131-136.

C. L. Hamblin [1984]: Languages of Asia and the Pacific: A Phrasebook for Travellers and Students. (North Ryde, NSW: Angus and Robertson).

C. L. Hamblin [1987]: Imperatives. Oxford, UK: Basil Blackwell.

C. L. Hamblin and P. J. Staines [1992]: An extraordinarily simple theory of the syllogism. Logique et Analyse, 35: 81.

S. H. Lavington [1980]: Early British Computers: The Story of Vintage Computers and the People who Built Them. Manchester, UK: Manchester University Press.

P. McBurney and S. Parsons [2009]: Dialogue games for agent argumentation. Chapter 13 in: I. Rahwan and G. Simari (Editors): Argumentation in Artificial Intelligence. Berlin, Germany: Springer, pp. 261-280.

R. J. Nelson [1955]: Review of: “An analysis of a logical machine using paranthesis-free notation” by Arthur W. Burks, Don. W. Warren and Jesse B. Wright, The Journal of Symbolic Logic, 20 (1): 70-71.

T. J. Norman and C. Reed [2010]: A logic of delegation. Artificial Intelligence, 174 (1): 51-71.

T. Pearcey [1994]: Australian Computing: The Second Generation. Published in: J. M. Bennett, R. Broomham, P. M. Murton, T. Pearcey and R. W. Rutledge (Editors): Computing in Australia: The Development of a Profession. Australian Computer Society.

C. A. Reed. and T. J. Norman [2007]: A formal characterisation of Hamblin’s action-state semantics. Journal of Philosophical Logic, 36 (4): 415-448.

G. L. S. Shackle [1969]: Decision Order and Time in Human Affairs. Cambridge, UK: Cambridge University Press. Second Edition.

A. Tarski [1951]: A Decision Method for Elementary Algebra and Geometry. Berkeley, CA, USA: University of California Press.

R. A. Vowels [1978]: Introduction to PL/I, Algorithms and Structured Programming. Melbourne, 1978.

G. Williams [1985]: A shy blend of logic, maths and languages. (Obituary of Charles Hamblin). Sydney Morning Herald, 1985.

In compiling this biography, I am grateful for information and support received from: Gordon Bell, Jim Crosswhite, David Hitchcock, Jim Mackenzie, Vaughan Pratt, Michael Scriven, Phillip Staines, Robin Vowels, Doug Walton, and the family of the late Charles Hamblin. The views I express here are, of course, solely my own.

Copyright, 2003-2011.  All rights reserved.




2 Responses to “A salute to Charles Hamblin”


  1. 1 John GEREMIN

    Readers may like to know that the Australian Computer Museum Society web site is at http://www.acms.org.au — and that the ACMS Inc is still searching for Display Space in which to commemorate Australian Computing Pioneers.

  2. 2 peter

    Thanks, John. I have added a link to the ACMS site.

Comments are currently closed.