Sciweavers

7486 search results - page 260 / 1498
» The Limits of Quantum Computers
Sort
View
MFCS
1998
Springer
15 years 10 months ago
One Guess One-Way Cellular Arrays
One-way cellular automata with restricted nondeterminism are investigated. The number of allowed nondeterministic state transitions is limited to a constant. It is shown that a lim...
Thomas Buchholz, Andreas Klein, Martin Kutrib
STACS
2010
Springer
16 years 1 months ago
Revisiting the Rice Theorem of Cellular Automata
Abstract. A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neigh...
Pierre Guillon, Gaétan Richard
CIG
2005
IEEE
16 years 8 days ago
On TRACS: Dealing with a Deck of Double-Sided Cards
TRACS (Tool for Research on Adaptive Cognitive Strategies) is a new suite of card games played with a special deck, where the back of each card is a clue to the front of the card. ...
Kevin Burns
FCT
1999
Springer
15 years 11 months ago
Iterative Arrays with a Wee Bit Alternation
Abstract. An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fe...
Thomas Buchholz, Andreas Klein, Martin Kutrib
IJCAI
1989
15 years 7 months ago
Using and Refining Simplifications: Explanation-Based Learning of Plans in Intractable Domains
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
Steve A. Chien