4940 search results - page 86 / 988 » On the Complexity of Universal Programs |
130
click to vote
SAS
2004
Springer
15 years 9 months ago
2004
Springer
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
139
click to vote
ACMSE
2007
ACM
15 years 8 months ago
2007
ACM
In this paper we describe our experience in integrating the RIM's BlackBerry handheld wireless device into programming and literacy courses at the University of Guelph and th...
264
click to vote
Book
"The book is the textbook for the programming languages course at Brown University, which is taken primarily by third and fourth year undergraduates and beginning graduate (bo...
141
click to vote
ENTCS
2010
15 years 1 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...
168
click to vote
PODS
1991
ACM
15 years 8 months ago
1991
ACM
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...