5 citations · 12 across the 9 of their papers we have counts for
9 papers
Friedman's "Long Finite Sequences'': The End of the Busy Beaver Contest
Michael Vielhaber, Mónica del Pilar Canales Chacón, Sergio Jara Ceballos
Harvey Friedman gives a comparatively short description of an ``unimaginably large'' number , beyond, e.g. the values of Ackermann's f…
V Tree -- Continued Fraction Expansion, Stern-Brocot Tree, Minkowski's Function In Binary: Exponentially Faster
Michael Vielhaber
The Stern-Brocot tree and Minkowki's question mark function (or Conway's box function) are related to the continued fraction expansion of numbers from Q with unary encoding…
Computing by Temporal Order: Asynchronous Cellular Automata
Michael Vielhaber
Our concern is the behaviour of the elementary cellular automata with state set 0,1 over the cell set Z/nZ (one-dimensional finite wrap-around case), under all possible update rule…
The Asymptotic Normalized Linear Complexity of Multisequences
Michael Vielhaber, Monica del Pilar Canales
We show that the asymptotic linear complexity of a multisequence a in F_q^\infty that is I := liminf L_a(n)/n and S := limsup L_a(n)/n satisfy the inequalities M/(M+1) <= S <= 1 an…
The Battery-Discharge-Model: A Class of Stochastic Finite Automata to Simulate Multidimensional Continued Fraction Expansion
Michael Vielhaber, Monica del Pilar Canales
We define an infinite stochastic state machine, the Battery-Discharge-Model (BDM), which simulates the behaviour of linear and jump complexity of the continued fraction expansion o…
Moments for generalized Farey-Brocot partitions
Nikolai Moshchevitin, Michael Vielhaber
We generalize the Farey-Brocot partition to a twodimensional continued fraction algorithm and generalized Farey-Brocot nets. We give an asymptotic formula for the moments of order…