64 search results - page 6 / 13 » Computability of Countable Subshifts |
MCU
2004
15 years 1 months ago
2004
Many different definitions of computational universality for various types of systems have flourished since Turing's work. In this paper, we propose a general definition of un...
JSYML
2010
14 years 6 months ago
2010
We say a countable model A has a 0-basis if the types realized in A are uniformly computable. We say A has a (d-)decidable copy if there exists a model B = A such that the element...
MFCS
2005
Springer
15 years 5 months ago
2005
Springer
A partial information algorithm for a language A computes, for some fixed m, for input words x1, . . . , xm a set of bitstrings containing χA(x1, . . . , xm). E.g., p-selective, ...
105
click to vote
CONCUR
2008
Springer
15 years 1 months ago
2008
Springer
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
CONCUR
2003
Springer
15 years 5 months ago
2003
Springer
We investigate which event structures can be denoted by means of closed CCS ∪ CSP expressions. Working up to isomorphism we find that • all denotable event structures are bund...