Sciweavers

1701 search results - page 3 / 341
» Computer Science and State Machines
Sort
View
STACS
2010
Springer
15 years 4 months ago
Evolving Multialgebras Unify All Usual Sequential Computation Models
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
Serge Grigorieff, Pierre Valarcher
NEUROSCIENCE
2001
Springer
15 years 2 months ago
Finite-State Computation in Analog Neural Networks: Steps towards Biologically Plausible Models?
Abstract. Finite-state machines are the most pervasive models of computation, not only in theoretical computer science, but also in all of its applications to real-life problems, a...
Mikel L. Forcada, Rafael C. Carrasco
SIGCSE
2006
ACM
355views Education» more  SIGCSE 2006»
15 years 3 months ago
Why students with an apparent aptitude for computer science don't choose to major in computer science
The statistics show that the number of Computer Science majors is dropping across the United States. Possible reasons include a reduced number of jobs in the field, an incorrect p...
Lori Carter
SPIN
2005
Springer
15 years 3 months ago
Model Checking Machine Code with the GNU Debugger
Embedded software verification is an important verification problem that requires the ability to reason about the timed semantics of concurrent behaviors at a low level of atomic...
Eric Mercer, Michael Jones