429 search results - page 40 / 86 » Noisy Turing Machines |
120
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
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...
139
click to vote
ICTAC
2004
Springer
15 years 10 months ago
2004
Springer
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 ...
136
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
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 ...
127
click to vote
SIGCSE
1999
ACM
15 years 8 months ago
1999
ACM
An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback...
139
click to vote
VL
1998
IEEE
15 years 8 months ago
1998
IEEE
We introduce visual graphs as an intermediate repren between concrete visual syntax and abstract graph syntax. In a visual graph some nodes are shown as geometric figures, and som...