244 search results - page 11 / 49 » Turing machines and bimachines |
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
FUIN
2007
13 years 7 months ago
2007
We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class ...
ANNALS
2010
13 years 4 months ago
2010
The increasing popularity in the late 1970s of affordable, general-purpose, microprocessor-based personal computers in the US, generated a widespread interest around the world in t...
UC
2009
Springer
14 years 1 months ago
2009
Springer
The paper surveys the fundamental principles of evolvable hardware, introduces main problems of the field and briefly describes the most successful applications. Although evolvab...
NDJFL
2010
13 years 2 months ago
2010
Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem ...