CORR
2010
Springer
13 years 9 months ago
2010
Springer
CORR
2010
Springer
13 years 9 months ago
2010
Springer
An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in th...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comona...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
A new fast (real time) sorter of binary numbers by one-dimensional cellular automata is proposed. It sorts a list of n numbers represented by k-bits each in exactly nk steps. This ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
CORR
2010
Springer
13 years 9 months ago
2010
Springer
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Recently, the statistical restricted isometry property (RIP) has been formulated to analyze the performance of deterministic sampling matrices for compressed sensing. In this paper...