2436 search results - page 59 / 488 » Comonadic Notions of Computation |
132
Voted
CIE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
103
Voted
CF
2004
ACM
15 years 9 months ago
2004
ACM
Current processor and multiprocessor architectures are almost all based on the Von Neumann paradigm. Based on this paradigm, one can build a general-purpose computer using very fe...
136
Voted
AINA
2004
IEEE
15 years 7 months ago
2004
IEEE
: Wide area network (WAN) -based distributed computing (DC) has become an active field of research, especially under the label of grid computing. On the other hand, research on WAN...
110
click to vote
AAAI
1997
15 years 5 months ago
1997
Automated problem solving is viewed typically as the expenditure of computation to solve one or more problems passed to a reasoning system. In response to each problem received, e...
112
Voted
AO
2007
15 years 3 months ago
2007
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...