4940 search results - page 290 / 988 » On the Complexity of Universal Programs |
177
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We propose some slight additions to O-O languages to implement the necessary features for using Deductive Object Programming (DOP). This way of programming based upon the manipula...
186
Voted
LISP
2008
15 years 6 months ago
2008
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
187
click to vote
ORL
2000
15 years 6 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
170
click to vote
PDPTA
2010
15 years 4 months ago
2010
The problem of programmability on modern heterogeneous multicore and future manycore embedded platforms is still not solved satisfactorily: although many existing but incompatible ...