562 search results - page 10 / 113 » Concurrent Turing Machines |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
TCS
2010
14 years 4 months ago
2010
58
Voted
MFCS
2000
Springer
15 years 1 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
15 years 3 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...
79
Voted
CSL
2005
Springer
15 years 3 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...