242 search results - page 10 / 49 » Zigzags in Turing Machines |
TCS
2010
13 years 2 months ago
2010
MFCS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
SIGCSE
2006
ACM
14 years 1 months ago
2006
ACM
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...
CSL
2005
Springer
14 years 1 months ago
2005
Springer
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
IGPL
2006
13 years 7 months ago
2006
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...