14190 search results - page 198 / 2838 » computer 2008 |
141
Voted
SIAMCOMP
2000
15 years 4 months ago
2000
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
TCS
2002
15 years 4 months ago
2002
The first example of an absolutely normal number was given by Sierpinski in 1916, twenty years before the concept of computability was formalized. In this note we give a recursive...
111
click to vote
DAM
2006
15 years 4 months ago
2006
Andrews et al. [Automatic method for hiding latency in high bandwidth networks, in: Proceedings of the ACM Symposium on Theory of Computing, 1996, pp. 257
146
click to vote
SIGPLAN
2008
15 years 4 months ago
2008
While the programming languages course played a key role in Curricula '68, '78, and '91, Curriculum 2001 replaced most of the content in programming languages with ...
164
click to vote
LOGCOM
2008
15 years 4 months ago
2008
We investigate mathematical modelling with theories of data types. We provide a formal setting for the formulation of such theories (TPL) and use it to introduce the notion of a c...