Foreword re C. S. Wallace

  title={Foreword re C. S. Wallace},
  author={David L. Dowe},
  journal={Comput. J.},
  • D. Dowe
  • Published 1 September 2008
  • Computer Science
  • Comput. J.
One of the second generation of computer scientists, Chris Wallace completed his tertiary education in 1959 with a Ph.D. in nuclear physics, on cosmic ray showers, under Dr Paul George at Sydney University. Needless to say, computer science was not, at that stage, an established academic discipline. With Max Brennan and John Malos he had designed and built a large automatic data logging system for recording cosmic ray air shower events and with Max Brennan also developed a complex computer… 

Figures from this paper

Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence

  • D. Dowe
  • Computer Science
    Lecture Notes in Computer Science
  • 2013
Algorithmic probability and friends: Proceedings of the Ray Solomonoff 85th memorial conference is a collection of original work and surveys that contains 35 papers pertaining to the abovementioned topics in tribute toRay Solomonoff and his legacy.

Revisiting Turing and His Test: Comprehensiveness, Qualia, and the Real World

A labelling schema for a set of diverse artificial intelligence tests inspired by a procedure initially proposed by Alan Mathison Turing is presented in order to standardize attribution and evaluation of the legal status of Artificial Agents (AAs).

MML, hybrid Bayesian network graphical models, statistical consistency, invarianc

On More Realistic Environment Distributions for Defining, Evaluating and Developing Intelligence

This paper agrees with previous criticisms that a universal distribution using a reference universal Turing machine (UTM) over tasks, environments, etc., is perhaps amuch too general and proposes the notion of Darwin-Wallace distribution for environments, which is inspired by biological evolution, artificial life and evolutionary computation.

IQ tests are not for machines, yet

How universal can an intelligence test be?

It is argued that such tests must be highly adaptive, i.e. that tasks, resolution, rewards and communication have to be adapted according to how the evaluated agent is reacting and performing, and set the quest for universal tests as a progressive rather than absolute goal.

On environment difficulty and discriminating power

A way to estimate the difficulty and discriminating power of any task instance by analysing the performance of a population of agent policies against the task, leading to a distribution that is examined in terms of policy complexity.

Inductive Inference and Partition Exchangeability in Classification

It is proven that, in contrast to classifiers based on de Finetti type exchangeability which can optimally handle test items independently of each other in the presence of infinite amounts of training data, a classifier based on partition exchangeability still continues to benefit from a joint prediction of labels for the whole population of test items.



A computer program capable of passing I.Q. tests

A fairly elementary WWW-based computer program is presented here a fairly elementary I.Q. test which regularly obtains a score close to the purported average human score of 100, and is briefly considered to ascribe intelligence to the program.

Wallace's Approach to Unsupervised Learning: The Snob Program

The Snob program for unsupervised learning as it has evolved from its beginning in the 1960s until its present form, with particular attention to the revision of Snob in the 1980s where definite assignment of things to classes was abandoned.

In Search of the Philosopher's Stone: Remarks on Humphreys and Freedman's Critique of Causal Discovery

In medieval times the philosopher's stone was supposed to enable its possessors to convert base metals into gold. Its discovery would revolutionize the world, presumably not by undermining the value

Discussion of the Papers by Rissanen, and by Wallace and Dowe

Commenting on the papers by Dr Rissanen and Professors Wallace and Dowe is a daunting sort of pleasure. Superficially, the papers are not closely related: Dr Rissanen has focused on the Shtarkov

MML clustering of multi-state, Poisson, von Mises circular and Gaussian distributions

This work outlines how MML is used for statistical parameter estimation, and how the MML mixture modelling program, Snob, uses the message lengths from various parameter estimates to enable it to combine parameter estimation with selection of the number of components and estimation of the relative abundances of the components.

Bayes not Bust! Why Simplicity is no Problem for Bayesians1

This work defends a Bayesian alternative: the simplicity of a theory is to be characterised in terms of Wallace's Minimum Message Length (MML), and shows that MML provides answers to many of Forster's objections to Bayesianism.

The discovery of algorithmic probability: A guide for the programming of true creativity

This talk will describe a voyage of discovery the discovery of Algorithmic Probability, the result of "goat motivated discovery" like theiscovery of the double helix in biology, but with fewer people involved and relatively little political skullduggery.

C4.5: Programs for Machine Learning

A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.


We thank Dr Gilbert and Professor Sinha for their thoughtful and provocative comments. We would like to respond to several points that have emerged from the discussion. Professor Sinha expresses some