54 search results - page 6 / 11 » cie 2007 |
CIE
2007
Springer
15 years 4 months ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...
102
click to vote
CIE
2007
Springer
14 years 10 months ago
2007
Springer
Player enjoyment is perhaps the most important issue in successful game design, but is previously not addressed in the area of Pervasive games. Departing from the GameFlow model of...
CIE
2007
Springer
15 years 4 months ago
2007
Springer
The conventional wisdom presented in most computability books and historical papers is that there were several researchers in the early 1930’s working on various precise defini...
CIE
2007
Springer
15 years 4 months ago
2007
Springer
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
CIE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...