188 search results - page 1 / 38 » Back to the Complexity of Universal Programs |
CP
2008
Springer
13 years 6 months ago
2008
Springer
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
MCU
2004
13 years 6 months ago
2004
Abstract. This paper provides a framework enabling to define and determine the complexity of various universal programs U for various machines. The approach consists of first defin...
PERCOM
2010
ACM
13 years 3 months ago
2010
ACM
If we expect the computer to vanish in the background, to make pervasive computing a reality, first we must be able to provide the illusion that all the user’s computers, devic...
KES
2010
Springer
13 years 3 months ago
2010
Springer
While computation of biological information takes center stage in today’s research, knowledge-based query processing in biological databases has not gained much attention. The co...