429 search results - page 5 / 86 » Noisy Turing Machines |
CORR
2000
Springer
13 years 7 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
CIE
2009
Springer
14 years 1 months ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
CIE
2005
Springer
14 years 28 days ago
2005
Springer
• We produce a classification of the pointclasses of sets of reals produced by infinite time turing machines with 1-tape. The reason for choosing this formalism is that it appa...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
geometrical computation 4: small Turing universal signal machines J
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE