10 search results - page 1 / 2 » Notes on Restricted P Colonies |
ISIM
2007
14 years 9 days ago
2007
We continue the investigation of P coloniesintroduced in [7], of abstract computing devices composed of independent agents, acting and evolving in a shared environment. We determin...
LACL
2005
Springer
14 years 4 months ago
2005
Springer
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
ICGA
2006
13 years 11 months ago
2006
Bao is a member of the large family of mancala games. It is generally considered to be the most complex mancala game with respect to the number of game rules (Townshend, 1986; De ...
BIRTHDAY
2010
Springer
14 years 6 hour ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...