244 search results - page 23 / 49 » Turing machines and bimachines |
158
click to vote
UC
2009
Springer
16 years 18 days ago
2009
Springer
Geometrical Computation and Computable Analysis J´erˆome Durand-Lose⋆ Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P. 6759, F-45067 OR...
165
click to vote
CATS
2006
15 years 7 months ago
2006
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...
146
Voted
IGPL
2008
15 years 5 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...
182
click to vote
JAC
2008
15 years 7 months ago
2008
There are several systems consisting in an object that moves on the plane by following a given rule. It is frequently observed that these systems eventually fall into an unexplaine...
157
click to vote
ICALP
2007
Springer
16 years 7 days 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...