Grégory Lafitte

According to our database, Grégory Lafitte authored at least 17 papers between 2000 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2019

An algorithmic approach to characterizations of admissibles.

Bruno Durand, Grégory Lafitte

Proceedings of the Computing with Foresight and Industry, 2019

2017

On shift-invariant maximal filters and hormonal cellular automata.

Julien Cervelle, Grégory Lafitte

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Infinite Time Busy Beavers.

Oscar Defrain, Bruno Durand, Grégory Lafitte

Proceedings of the Unveiling Dynamics and Complexity, 2017

Admissibles in Gaps.

Merlin Carl, Bruno Durand, Grégory Lafitte, Sabrina Ouazzani

Proceedings of the Unveiling Dynamics and Complexity, 2017

2011

Sub-computabilities.

Fabien Givors, Grégory Lafitte

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010

Tilings: simulation and universality.

Grégory Lafitte, Michael Weiss

Math. Struct. Comput. Sci., 2010

Infinite Time Cellular Automata: a Real Computation Model.

Fabien Givors, Grégory Lafitte, Nicolas Ollinger

Proceedings of the Second Symposium on Cellular Automata "Journées Automates Cellulaires", 2010

2009

An Almost Totally Universal Tile Set.

Grégory Lafitte, Michael Weiss

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Constructing New Aperiodic Self-simulating Tile Sets.

Grégory Lafitte, Michael Weiss

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

Busy beavers gone wild

Grégory Lafitte

Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

A Topological Study of Tilings.

Grégory Lafitte, Michael Weiss

Proceedings of the Theory and Applications of Models of Computation, 2008

Goedel incompleteness revisited.

Grégory Lafitte

Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), 2008

Computability of Tilings.

Grégory Lafitte, Michael Weiss

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007

Universal Tilings.

Grégory Lafitte, Michael Weiss

Proceedings of the STACS 2007, 2007

2002

On Randomness and Infinity.

Grégory Lafitte

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001

How Powerful Are Infinite Time Machines?

Grégory Lafitte

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory.

Grégory Lafitte, Jacques Mazoyer

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000