8512 search results - page 108 / 1703 » Computing Theory With Relevance |
99
Voted
CIE
2007
Springer
15 years 10 months ago
2007
Springer
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finit...
137
click to vote
SIAMCOMP
2000
15 years 3 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...
CHI
2007
ACM
16 years 4 months ago
2007
ACM