611 search results - page 61 / 123 » Index Sets of Computable Structures with Decidable Theories |
FOAL
2009
ACM
14 years 3 months ago
2009
ACM
We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in se...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
OSDI
2008
ACM
14 years 9 months ago
2008
ACM
MapReduce is emerging as an important programming model for large-scale data-parallel applications such as web indexing, data mining, and scientific simulation. Hadoop is an open-...
KR
1998
Springer
14 years 1 months ago
1998
Springer
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
POPL
2008
ACM
14 years 9 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...