4940 search results - page 107 / 988 » On the Complexity of Universal Programs |
116
Voted
CORR
2002
Springer
15 years 4 months ago
2002
Springer
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...
158
click to vote
MM
2004
ACM
15 years 10 months ago
2004
ACM
In this paper, we describe ChucK – a programming language and programming model for writing precisely timed, concurrent audio synthesis and multimedia programs. Precise concurre...
123
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
We have investigated the potential for using genetic programming to evolve compiler parsing and translation routines for processing arithmetic and logical expressions as they are ...
146
click to vote
MP
2008
15 years 4 months ago
2008
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
133
click to vote
MEMBRANE
2007
Springer
15 years 10 months ago
2007
Springer
Some initial results on the study of conformon-P systems with negative values are reported. One model of these conformon-P systems is proved to be computationally universal while a...