منابع مشابه
Silicon Neurons That Compute
We use neuromorphic chips to perform arbitrary mathematical computations for the first time. Static and dynamic computations are realized with heterogeneous spiking silicon neurons by programming their weighted connections. Using 4K neurons with 16M feed-forward or recurrent synaptic connections, formed by 256K local arbors, we communicate a scalar stimulus, quadratically transform its value, a...
متن کاملOracles that Compute Values
This paper focuses on complexity classes of partial functions that are computed in polynomial time with oracles in NPMV, the class of all multivalued partial functions that are computable nondeterministically in polynomial time. Concerning deterministic polynomial-time reducibilities, it is shown that 1. a multivalued partial function is polynomial-time computable with k adaptive queries to NPM...
متن کاملComputing education that doesn't compute
The current UK debate on Computing in schools is driven by a specific issue: what should form the basis of a modern Computing education. It’s a perfect storm that has been brewing for some time, but the recent comments1 of Eric Schmidt, the chairman of Google, have moved it into the political arena. Currently, the mandatory educational component of Computing (from years 11 to 16) is taught as I...
متن کاملPattern recognition with “materials that compute”
Driven by advances in materials and computer science, researchers are attempting to design systems where the computer and material are one and the same entity. Using theoretical and computational modeling, we design a hybrid material system that can autonomously transduce chemical, mechanical, and electrical energy to perform a computational task in a self-organized manner, without the need for...
متن کاملOn Using Oracles That Compute Values
This paper focuses on complexity classes of partial functions that are computed in polynomial time with oracles in NPMV, the class of all multivalued partial functions that are computable nondeterministically in polynomial time. Concerning deterministic polynomial-time reducibilities, it is shown that 1. A multivalued partial function is polynomial-time computable with k adaptive queries to NPM...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific American
سال: 1987
ISSN: 0036-8733
DOI: 10.1038/scientificamerican0587-46