Reply to Krellenstein on Parallel Computation
نویسندگان
چکیده
منابع مشابه
Reply to Krellenstein on Parallel Computation
In replying to my argument that the speed furnished by parallel processing is highly relevant to the understanding of intelligence and mind, Krellenstein says that “the serial simulation of parallel processes and the portability of software are computational principles and everyday empirical realities.” While it is true that in principle parallel processes can be simulated on serial machines, t...
متن کاملA Reply to "Parallel Computation and the Mind-Body Problem"
The following is in reply to some points made in Paul Thagard's " Parallel Computation and the Mind-Body Problem " (1986). (1) Thagard argues that increased speed has metaphysical importance because only intelligent creatures (or machines) quick enough to adequately deal with the demands of their environment will survive. Thus, the best possible serial simulation of a parallel algorithm, while ...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملParallel Functional Computation on STAR:DUST
STAR:DUST (‘St. Andrews RISC: Dataflow Using Sequential Threads’) is a processor design optimized for efficient execution of sequential threads while supporting plug-and-play construction of large multiprocessor systems. Besides satisfying the major RISC criteria (small instruction set, simple instruction format, load/store principle, pipelining), STAR:DUST employs a dataflow approach to commun...
متن کاملOn the parallel computation thesis
We develop a generic programming language for parallel algorithms, one that works for all data structures and control structures. We show that any parallel algorithm satisfying intuitively-appealing postulates can be modeled by a collection of cells, each of which is an abstract state machine, augmented with the ability to spawn new cells. The cells all run the same algorithm and communicate vi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cognitive Science
سال: 1987
ISSN: 0364-0213
DOI: 10.1207/s15516709cog1102_3