1701 search results - page 44 / 341 » Computer Science and State Machines |
SIGCSE
2005
ACM
15 years 3 months ago
2005
ACM
This paper describes how the Institute for Computing Education (ICE) at Georgia Tech is trying to improve the state of computer science education in secondary schools in Georgia. ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
ICPR
2010
IEEE
14 years 7 months ago
2010
IEEE
This article presents an appearance based method to detect automatically facial actions. Our approach focuses on reducing features sensitivity to identity of the subject. We compu...
ASM
2005
ASM
15 years 3 months ago
2005
ASM
We consider a specific kind of Abstract State Machines. It is shown how the machines can be used to provide a low-level formal semantics for a tiny object-oriented language, inclu...
FCT
2009
Springer
15 years 4 months ago
2009
Springer
We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an infinitely repeate...