4940 search results - page 253 / 988 » On the Complexity of Universal Programs |
199
click to vote
ENTCS
2006
15 years 6 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
174
click to vote
IEEECIT
2010
IEEE
15 years 5 months ago
2010
IEEE
—In need of interesting material and effective teaching approach in programming learning, students were ely to drop out of the course for the abstract concepts and complex struct...
161
click to vote
IFIP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
166
click to vote
TASE
2009
IEEE
16 years 1 months ago
2009
IEEE
We explore the interactions between programvariable state visibility and communication behaviour in state-rich CSP-like processes, using the Unifying Theories of Programming (UTP)...
179
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— An autonomous robot system that is to act in a real-world environment is faced with the problem of having to deal with a high degree of both complexity as well as uncertainty. ...