429 search results - page 71 / 86 » Turing computations on ordinals |
LPNMR
2001
Springer
15 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 ...
78
Voted
ESCIENCE
2006
IEEE
15 years 1 months ago
2006
IEEE
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
93
Voted
UAI
2001
14 years 11 months ago
2001
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
78
Voted
JUCS
2002
14 years 9 months ago
2002
: A purely communicative variant of P systems was considered recently, based on the trans-membrane transport of couples of chemicals. When using both symport rules (the chemicals p...
BCSHCI
2009
14 years 7 months ago
2009
This paper reflects on the views of the human that were oriented to in two distinct research labs and which have been used to populate an inventive landscape over the past twenty ...