Mathematics and Computer Science: Coping with Finiteness
- 17 December 1976
- journal article
- research article
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 194 (4271) , 1235-1242
- https://doi.org/10.1126/science.194.4271.1235
Abstract
By presenting these examples, I have tried to illustrate four main points. 1) Finite numbers can be really enormous, and the known universe is very small. Therefore the distinction between finite and infinite is not as relevant as the distinction between realistic and unrealistic. 2) In many cases there are subtle ways to solve very large problems quickly, in spite of the fact that they appear at first to require examination of too many possibilities. 3) There are also cases where we can prove that a fairly natural problem is intrinsically hard, far beyond our conceivable capabilities. 4) It takes a good deal of skill to decide whether a given problem is in the easy or hard class; but even if a problem does turn out to be hard there are useful and interesting ways to change it into one that can be done satisfactorily.Keywords
This publication has 10 references indexed in Scilit:
- Analysis of Algorithms: Coping with Hard ProblemsScience, 1974
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- Combinatorial Analysis and ComputersThe American Mathematical Monthly, 1965
- Computer investigation of orthogonal Latin squares of order tenProceedings of Symposia in Applied Mathematics, 1963
- The size of the 10×10 orthogonal latin square problemPublished by American Mathematical Society (AMS) ,1960
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956
- Machine attacks on problems whose variables are permutationsProceedings of Symposia in Applied Mathematics, 1956
- Euler SquaresAnnals of Mathematics, 1922