1 citations · 2 across the 2 of their papers we have counts for
2 papers
nlin.CG2010★ 1 cited
Infinite Time Cellular Automata: A Real Computation Model
Fabien Givors, Grégory Lafitte, Nicolas Ollinger
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…
cs.LO2009★ 1 cited
Busy beavers gone wild
Grégory Lafitte
We show some incompleteness results a la Chaitin using the busy beaver functions. Then, with the help of ordinal logics, we show how to obtain a theory in which the values of the b…