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
LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems
Rachel Faran,Orna Kupferman +1 more
- 23 Oct 2018
TL;DR: This work develops an automata-theoretic approach for reasoning about LTLA formulas and uses it in order to solve, in PSPACE, the satisfiability problem for the existential fragment of LTLA and the model-checking problem for its universal fragment.
•Dissertation
Universal Temporal Concurrent Constraint Programming
Carlos Olarte
- 29 Sep 2009
TL;DR: The thesis is that utcc is a model for concurrency where behavioral and declarative reasoning techniques coexist coherently, thus allowing for the specification and verification of mobile reactive systems in emergent application areas.
Constructions with Countable Subshifts of Finite Type
Ville Salo,Ilkka Törmä +1 more
TL;DR: In this article, countable two-dimensional subshifts of finite type SFTs with interesting properties have been constructed, where the main focus is on properties of the topological derivatives and sub-pattern posets of these objects.
9
NSP: a Neuro---Symbolic Processor
Ernesto Burattini,Massimo De Gregorio,Victor Mauro Goulart Ferreira,Felipe M. G. França +3 more
- 05 Jun 2009
TL;DR: This paper presents an implementation methodology of weighted ANNs whose weights have already been computed and validation of this technique is made through the synthesis of circuits implementing the behaviour of specialised ANNs compiled from sets of logical clauses describing different logical problems.
9