242 search results - page 28 / 49 » Zigzags in Turing Machines |
ENTCS
2007
13 years 7 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
IGPL
2008
13 years 7 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
DIGRA
2005
Springer
14 years 1 months ago
2005
Springer
An examination of the contributions that can be made by the field of non-mechanistic cybernetics (as elaborated by Gregory Bateson and Anthony Wilden) to a theory of videogames th...
ADC
2004
Springer
14 years 1 months ago
2004
Springer
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...