18 search results - page 2 / 4 » tamc 2007 |
TAMC
2007
Springer
14 years 3 months ago
2007
Springer
TAMC
2007
Springer
14 years 3 months ago
2007
Springer
We say that A ≤LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on ...
TAMC
2007
Springer
14 years 3 months ago
2007
Springer
The Collatz problem, widely known as the 3x + 1 problem, asks whether or not a certain simple iterative process halts on all inputs. We build on earlier work by J. H. Conway, and ...
TAMC
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
TAMC
2007
Springer
14 years 3 months ago
2007
Springer
A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. ˇCerny co...