1055 search results - page 64 / 211 » Enumerations in computable structure theory |
168
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We analyze the structure and evolution of discussion cascades in four popular websites: Slashdot, Barrapunto, Meneame and Wikipedia. Despite the big heterogeneities between these ...
161
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...
129
click to vote
ACS
2007
15 years 6 months ago
2007
We present various results of the last twenty years converging towards a homotopical theory of computation. This new theory is based on two crucial notions : polygraphs (introduce...
196
click to vote
FSTTCS
2009
Springer
16 years 12 days ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
157
click to vote
ENTCS
2006
15 years 5 months ago
2006
It is common practice in both theoretical computer science and theoretical physics to describe the (static) logic of a system by means of a complete lattice. When formalizing the d...