4940 search results - page 108 / 988 » On the Complexity of Universal Programs |
150
click to vote
MFPS
1993
15 years 8 months ago
1993
al abstract machine for graph reduction Alan Jeffrey Report 3/92 August 1992 Computer Science School of Cognitive and Computing Sciences University of Sussex Brighton BN1 9QH ISSN ...
POS
1989
Springer
15 years 8 months ago
1989
Springer
ro, D.S. “The Persistent Abstract Machine Version 10 / Napier88 (Release 2.0)”. Universities of St Andrews and Adelaide (1994).
131
Voted
STOC
1991
ACM
15 years 8 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
130
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. We call devices with that structure “inference de...
237
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...