See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/250868794

The Theory of Computer Science

Article  in  IEE Journal on Computers and Digital Techniques · January 1978

DOI: 10.1049/ij-cdt.1978.0014

CITATIONS READS

9 3,254

1 author:

Igor Aleksander
Imperial College London
282 PUBLICATIONS   2,967 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Neural correlates of cognitive phenomenoloogy View project

All content following this page was uploaded by Igor Aleksander on 13 May 2014.

The user has requested enhancement of the downloaded file.

 References

1 'Recent developments in digital logic design'. Proceedings of 6 EDWARDS, C.R.: 'Matrix methods in combinational logic
conference at School of Electrical Engineering, University of design'. Ph.D. thesis, University of Bath, 1973
Bath, UK, Sept. 1977 7 DERTOUZOS, M.L.: "Threshold logic: a synthesis approach'.
2 LECHNER, R.J.: 'Harmonic analysis of switching functions', in Research Monograph 32, MIT Press, 1965
MUKHOPADHYAY, A. (Ed.): 'Recent developments in switching 8 HURST, S.L.: 'Testing logic networks', Wireless World, 1977,
theory' (Academic Press, New York, 1971) 83, pp. 82-86
3 KARPOVSKY, M.G.: 'Finite orthogonal series in the design of 9 WALLIS, J.S.: 'Hadamard matrices', (Springer-Verlag, Lecture
digital devices' (John Wiley, N.Y., 1976) notes 292 N.Y., 1972)
4 EDWARDS, C.R.: 'The application of the Rademacher-Walsh 10 GOLOMB, S.B.: 'On the classification of Boolean functions',
transform to Boolean function classification and threshold-logic IRE Trans., 1959, CT6, special supplement, pp. 176-186
synthesis', IEEE Trans., 1975, C-24, pp. 48-62 11 EDWARDS, C.R.: "The design of easily tested circuits using
5 HURST, S.L.: "The application of Chow parameters and mapping and spectral techniques', Radio & Electron. Engin.,
Rademacher-Walsh matrices in the synthesis of binary functions', 1977, 47, pp. 321-342
Comput. J., 1973,16, pp. 165-173

Book reviews The metatheory asks where, in the world of information-

processing concepts, does one find tools which are applicable
The theory of computer science to computing? The theory of finite-state machines is
J.M. Brady rapidly (but thoroughly) dismissed, since, through its finite
Chapman & Hall, 1977, 250pp., £750 (paperback £395), nature, it does not apply to even simple computations such
ISBN 0 412 12930 3 as multiplication. Turing-machine concepts get around the
problem of finiteness by assuming the existence of an in-
When the word 'theory' is mentioned in polite conversation, finite tape on which symbols may be written and from
many (including computer engineers and scientists) either which they may be read. Much centres on Turing's thesis
shrink away, feeling insecure in their lack of knowledge of that 'processes which could naturally be called algorithms
mathematics, or ask whether it is of immediate use. If not are precisely those which can be carried out on Turing
the latter, they feel justified in shrinking away for ever. machines'.
I take the opposite view, and side with Mike Brady, who Since 'computability' must be central to the sought-after
at the outset of his book firmly states that '. . . theory in- theory, the author goes on to seek a way of expressing
creases our understanding of, and systematises our knowl- this as programming effort related to Turing machines,
edge about, the subject domain'. He goes on to say that leading to the concept of the general recursive functions of
significant practical advances are possible in the case of a Hilbert and Kleene, which provide a formalism that supports
theory of computer science. This added bonus is important Turing's thesis.
since it often stops people from wasting their time on un- The nature of the 'computability' discussion in Part I is
attainable projects. such that it deals essentially with seemingly negative results,
Brady's book is the first of which I know that, in terms that is, 'what can't be computed?' In contrast, Part II starts
that most can understand, discusses both the nature of the with the list-processing type of formalism developed by
limitations and concepts inherent in a science of com- McCarthy and approaches positive results. These range over
puting (a metatheory) and the extent to which we have questions of problem solving, the nature of programming
travelled towards the development and application of a languages, data structures, and program termination.
theory in itself. The book is compellingly written, and its paperback
After setting out the philosophical and practical ob- version should be welcomed by students and teachers of
jectives in a compact and clear way in the first chapter, the computer science and electronic information systems as an
rest of the book is divided into two parts corresponding to enlightening and stimulating text. The hardened programmer
the metatheoretical and theoretical aims mentioned in the might also find it mind-broadening reading.
paragraph above. I. ALEKSANDER

Microprogrammable computer architectures

Alan B. Salisbury microinstructions confirms me in my view that this termin-
North-Holland, 1976, 162 + xiipp., US $17-95/Dfl. 4500, ology has now become so confused as to be no longer
ISBN 0 444 00175 1 useful.
The remaining two-thirds of the book deal with particular
machines. There are chapters on the Microdata 3200, the
This short book provides an introduction to the architecture
Interdata 8/32, the Burroughs B1700, and the Nanodata
of computers designed to support microprogramming by QM-1; a final chapter deals more briefly with the Control
the user, in contrast to computers with read-only control Data 5600, the Digital Scientific META4, the HP2100/
memories that have been designed to implement a par- 21 MX, the Varian 73, the Intel 3000, and the Western
ticular machine language. By architecture is meant those Digital MCP 1600. There is much material packed into these
aspects of the structure that are seen by the user. The first chapters, which are illustrated with tables and diagrams
three chapters provide a historical overview of the subject taken in many instances from the manufacturers' manuals.
and develop a comprehensive framework for the analysis Some readers will perhaps find the accompanying text rather
of the architecture of various machines. Matters touched on too condensed. Nevertheless, the book is to be welcomed for
are whether the format of a microinstruction is fixed or the amount of information that it brings together.
variable, how many fields it contains, and the degree to
which the information in them is coded, together with
various aspects of microinstruction sequencing. I might M.V.WILKES
remark in passing that the section on horizontal and vertical

48 COMPUTERS AND DIGITAL TECHNIQUES, MA Y 1978, Vol. 1, No. 2