244 search results - page 31 / 49 » Turing machines and bimachines |
COLT
2004
Springer
14 years 3 months ago
2004
Springer
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
LPNMR
2001
Springer
14 years 2 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
ENTCS
2010
13 years 7 months ago
2010
Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems not...
SIGIR
2011
ACM
13 years 18 days ago
2011
ACM
This work explores the problem of cross-lingual pairwise similarity, where the task is to extract similar pairs of documents across two different languages. Solutions to this pro...
TCS
2008
13 years 9 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...