3378 search results - page 42 / 676 » A universe of binding and computation |
ESOP
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. This paper presents GMeta: a generic framework for firstorder representations of variable binding that provides once and for all many of the so-called infrastructure lem...
TCBB
2008
14 years 9 months ago
2008
The problem of discovering novel motifs of binding sites is important to the understanding of gene regulatory networks. Motifs are generally represented by matrices (PWM or PSSM) o...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
96
Voted
TCS
2011
14 years 4 months ago
2011
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
50
Voted
CHI
2010
ACM
15 years 4 months ago
2010
ACM
