8699 search results - page 32 / 1740 » Elements of the Theory of Computation |
GECCO
2004
Springer
14 years 28 days ago
2004
Springer
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
BIRTHDAY
1997
Springer
13 years 11 months ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
SLIP
2004
ACM
14 years 29 days ago
2004
ACM
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
