this post was submitted on 07 Dec 2023
1 points (55.6% liked)

Mathematics

475 readers
1 users here now

A community for discussing mathematics and developments in mathematics.

founded 2 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
[–] qwertyasdef@programming.dev 1 points 9 months ago

I don't think Turing-completeness implies omniperiodicity. I'm imagining a cellular automaton which follows Game of Life rules on even-numbered generations and does nothing on odd-numbered generations, which is trivially Turing-complete because it's just Conway's Game of Life if you ignore every other generation, but also trivially has no odd-period oscillators.