Sciweavers

315 search results - page 39 / 63
» Reactive Turing Machines
Sort
View
SIGCSE
2004
ACM
100views Education» more  SIGCSE 2004»
15 years 11 months ago
A visual and interactive automata theory course with JFLAP 4.0
We describe the instructional software JFLAP 4.0 and how it can be used to provide a hands-on formal languages and automata theory course. JFLAP 4.0 doubles the number of chapters...
Ryan Cavalcante, Thomas Finley, Susan H. Rodger
ATAL
2004
Springer
15 years 11 months ago
Using the Experimental Method to Produce Reliable Self-Organised Systems
The ‘engineering’ and ‘adaptive’ approaches to system production are distinguished. It is argued that producing reliable self-organised software systems (SOSS) will necessa...
Bruce Edmonds
ICALP
2004
Springer
15 years 11 months ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry
ICTAC
2004
Springer
15 years 11 months ago
Replicative - Distribution Rules in P Systems with Active Membranes
Abstract. P systems (known also as membrane systems) are biologically motivated theoretical models of distributed and parallel computing. The two most interesting questions in the ...
Tseren-Onolt Ishdorj, Mihai Ionescu
ISAAC
2004
Springer
87views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Random Access to Advice Strings and Collapsing Results
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
Jin-yi Cai, Osamu Watanabe