Average case complete problems
SIAM Journal on Computing
Journal of Computer and System Sciences
Rice's theorem for the limit sets of cellular automata
Theoretical Computer Science
Reversibility and surjectivity problems of cellular automata
Journal of Computer and System Sciences
Inversion of 2D cellular automata: some complexity results
Theoretical Computer Science
Regular Article: The surjectivity problem for 2D cellular automata
Proceedings of the 30th IEEE symposium on Foundations of computer science
A random NP-complete problem for inversion of 2D cellular automata
Theoretical Computer Science
Theoretical Computer Science
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Hi-index | 0.00 |
We establish a first step towards a "Rice theorem" for tilings: for non-trivial sets, it is undecidable to know whether two different tile sets produce the same tilings of the place. Then, we study quasiperiodicity functions associated with tilings. This function is a way to measure the regularity of tilings. We prove that, not only almost all recursive functions can be obtained as quasiperiodicity functions, but also, a function which overgrows any recursive function.