939 search results - page 46 / 188 » Semantic Abstraction and Quantum Computation |
CIE
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
CIE
2005
Springer
14 years 11 months ago
2005
Springer
Since Di Gianantonio [1993] introduced his semantics for exact real omputation, there has always been a struggle to maintain data abstraction and efficiency as much as possible. T...
100
click to vote
CONTEXT
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The knowledge representation tradition in computational lexicon design represents words as static encapsulations of purely lexical knowledge. We suggest that this view po...
BIRTHDAY
2008
Springer
14 years 11 months ago
2008
Springer
e [43] is the first paper on final, observational semantics in abstract data types, and the main reference for one of the MoC contributed papers in this volume. It presented severa...