The Mathematical Revolution Inspired by Computing: Based on the Proceedings of a Conference on the Mathematical Revolution Inspired by Computing, Organized by the Institute of Mathematics and Its Applications and Held at Brighton Polytechnic in April 1989Jeffrey Johnson, Martin Loomes The impact that computers has had on mathematics and mathematicians is profound. This volume presents a survey of the many ways in which this influence has been felt and the implications these have for the future development of mathematics. Individual chapters cover topics as diverse as automated theorem proving, computational algebra, word-processing algorithms, the Z specification language for computer systems, the use of types in computing, neural networks, and dynamical systems. All the contributors are experts in their respective fields and, as a result, not only does the volume provide insights into how computers are used in mathematics, but also, (perhaps more significantly) how the advent of computers has changed both the way mathematicians work and the nature of the problems that they study. |
Contents
List of Contributors | 3 |
CryptographyThe Catalyst | 21 |
The Return of the Visual | 33 |
Copyright | |
21 other sections not shown
Other editions - View all
Common terms and phrases
1991 The Institute abstract application attractor backcloth basepoint behaviour bifurcation busy beaver Calculus of Constructions Cantor set category theory chaos chaotic complex systems Computer Science consider context corresponding cost estimation model defined definition denote describe diagonal algorithm dynamics elements environment equations example Figure finite fixed point flip bifurcation formal fractal geometry given graph hierarchical idea input Inspired by Computing integers iteration Johnson & M J lambda calculus lattice logic M J Loomes eds math mathematical models Mathematical Revolution Inspired mathematicians measurement methods natural numbers nodes notation notion NP-complete operations orbit Oxford University Press parallel computers pixel polynomial possible predicate primitive problem production programming languages Prolog proof R₁ relation result rules sequence set theory simple software engineering solution specification string structure subset symbol template theorem traffic Turing machine valuations values variables vertex vertices weak integers