3353 search results - page 147 / 671 » Laver and set theory |
193
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
194
click to vote
IFIP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
240
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Domino problem. In this paper, we prove that the problem remains undecidable if t...
182
click to vote
QEST
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--We introduce a stochastic extension of CCS endowed with structural operational semantics expressed in terms of measure theory. The set of processes is organised as a meas...
191
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...