Sciweavers

315 search results - page 46 / 63
» Reactive Turing Machines
Sort
View
LPAR
2005
Springer
14 years 1 months ago
The Four Sons of Penrose
Abstract. We distill Penrose’s argument against the “artificial intelligence premiss”, and analyze its logical alternatives. We then clarify the different positions one can...
Nachum Dershowitz
MCU
1998
119views Hardware» more  MCU 1998»
13 years 9 months ago
DNA Computing Based on Splicing: Universality Results
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
Gheorghe Paun
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 8 months ago
Decisive Markov Chains
We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almos...
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Ma...
CORR
2004
Springer
137views Education» more  CORR 2004»
13 years 8 months ago
Implementation of Logical Functions in the Game of Life
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...
Jean-Philippe Rennard
CONCUR
2010
Springer
13 years 9 months ago
Learning I/O Automata
Links are established between three widely used modeling frameworks for reactive systems: the ioco theory of Tretmans, the interface automata of De Alfaro and Henzinger, and Mealy ...
Fides Aarts, Frits W. Vaandrager