2588 search results - page 220 / 518 » Applications of Kolmogorov complexity to computable model th... |
184
click to vote
ATAL
2007
Springer
16 years 24 days ago
2007
Springer
We develop a model of normative systems in which agents are assumed to have multiple goals of increasing priority, and investigate the computational complexity and game theoretic ...
168
click to vote
STACS
1994
Springer
15 years 10 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
192
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
141
click to vote
ACII
2007
Springer
16 years 24 days ago
2007
Springer
Recent years have seen an explosion of interest in computational models of socio-emotional processes, both as a mean to deepen understanding of human behavior and as a mechanism to...
165
click to vote
ISSAC
2001
Springer
15 years 11 months ago
2001
Springer
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...