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

Mathematics

495 readers
1 users here now

A community for discussing mathematics and developments in mathematics.

founded 2 years ago
MODERATORS
top 3 comments
sorted by: hot top controversial new old
[–] davel@lemmy.ml 1 points 11 months ago* (last edited 11 months ago) (2 children)

I must be missing something. If CGL has already been proven to be Turing complete, and if Turing completion implies omniperiodicity (which seems trivially true), then what was the point of this exercise?

[–] davel@lemmy.ml 1 points 11 months ago

On an unrelated note, it looks as if someone's downvoting your every post on c/mathematics.

[–] qwertyasdef@programming.dev 1 points 11 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.