17298 search results - page 248 / 3460 » Abstract computing machines |
150
click to vote
IJFCS
2006
15 years 4 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
170
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--The now commonplace multi-core chips have introduced, by design, a deep hierarchy of memory and cache banks within parallel computers as a tradeoff between the user frien...
137
click to vote
CATS
2006
15 years 5 months ago
2006
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...