Open AccessBook
Computation: Finite and Infinite Machines
Marvin Minsky
- 01 Jan 1967
2.9K
TL;DR: In this article, the authors present an abstract theory that categorically and systematically describes what all these machines can do and what they cannot do, giving sound theoretical or practical grounds for each judgment, and the abstract theory tells us in no uncertain terms that the machines' potential range is enormous and that its theoretical limitations are of the subtlest and most elusive sort.
read more
Abstract: From the Preface (See Front Matter for full Preface)
Man has within a single generation found himself sharing the world with a strange new species: the computers and computer-like machines. Neither history, nor philosophy, nor common sense will tell us how these machines will affect us, for they do not do "work" as did machines of the Industrial Revolution. Instead of dealing with materials or energy, we are told that they handle "control" and "information" and even "intellectual processes." There are very few individuals today who doubt that the computer and its relatives are developing rapidly in capability and complexity, and that these machines are destined to play important (though not as yet fully understood) roles in society's future. Though only some of us deal directly with computers, all of us are falling under the shadow of their ever-growing sphere of influence, and thus we all need to understand their capabilities and their limitations.
It would indeed be reassuring to have a book that categorically and systematically described what all these machines can do and what they cannot do, giving sound theoretical or practical grounds for each judgment. However, although some books have purported to do this, it cannot be done for the following reasons: a) Computer-like devices are utterly unlike anything which science has ever considered---we still lack the tools necessary to fully analyze, synthesize, or even think about them; and b) The methods discovered so far are effective in certain areas, but are developing much too rapidly to allow a useful interpretation and interpolation of results. The abstract theory---as described in this book---tells us in no uncertain terms that the machines' potential range is enormous, and that its theoretical limitations are of the subtlest and most elusive sort. There is no reason to suppose machines have any limitations not shared by man.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
On flatness for 2-dimensional vector addition systems with states
Jérôme Leroux,Grégoire Sutre +1 more
TL;DR: In this paper, it was shown that 2-dim VASS are flat (i.e. they intrinsically contain no nested loops) and reachability sets are semilinear for forward, backward and binary reachability.
45
Annealed and quenched inhomogeneous cellular automata (INCA)
TL;DR: A probabilistic one-dimensional Cellular automaton model by Domany and Kinzel is mapped into an inhomogeneous cellular automaton with the Boolean functions XOR and AND as transition rules, related to critical behavior in directed percolation.
45
An improved universal spiking neural P system with generalized use of rules
Yun Jiang,Yansen Su,Fen Luo +2 more
- 01 Dec 2019
TL;DR: This work investigates the computational completeness of SNGR P systems and makes an improvement regarding to these related parameters, which provides an answer to the open problem mentioned in original work.
45
The theory of languages
Alfred V. Aho,Jeffrey D. Ullman +1 more
TL;DR: In this article, the principal methods of describing languages and the principal results concerning each method are given.
45