29046 search results - page 1 / 5810 » Computable Models |
GC
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We present the computational counterpart of the KGP (Knowledge, Goals, Plan) declarative model of agency for Global Computing. In this context, a computational entity is ...
ENTCS
2011
13 years 5 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
AISS
2010
13 years 8 months ago
2010
In this paper, we propose the computation model for computing an Inter-layer path based on PCE. Comparing the performance of these various models, we wanna propose the model that ...
UC
2005
Springer
14 years 4 months ago
2005
Springer
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
ISAAC
2005
Springer
14 years 4 months ago
2005
Springer
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...