4074 search results - page 67 / 815 » Defining Computational Aesthetics |
BSL
2005
13 years 7 months ago
2005
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length to computations on tapes of arbitrary ordinal length. We show that a ...
ICSE
2007
IEEE-ACM
14 years 1 months ago
2007
IEEE-ACM
Software and the computational behaviors it defines are increasingly important sources of both economic costs and benefits for companies, governments and individuals. Nevertheless...
JC
2006
13 years 7 months ago
2006
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Define a static algorithm as an algorithm that computes some combinatorial property of its input consisting of static, i.e., non-moving, objects. In this paper, we descri...
AML
2010
13 years 7 months ago
2010
Defining the degree of categoricity of a computable structure M to be the least degree d for which M is d-computably categorical, we investigate which Turing degrees can be realiz...