This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
This article is within the scope of WikiProject Video games, a collaborative effort to improve the coverage of video games on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Video gamesWikipedia:WikiProject Video gamesTemplate:WikiProject Video gamesvideo game articles
This article is within the scope of WikiProject Systems, which collaborates on articles related to systems and systems science.SystemsWikipedia:WikiProject SystemsTemplate:WikiProject SystemsSystems articles
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles
This article was copy edited by Tdslk, a member of the Guild of Copy Editors, on 9 May 2020.Guild of Copy EditorsWikipedia:WikiProject Guild of Copy EditorsTemplate:WikiProject Guild of Copy EditorsGuild of Copy Editors articles
What I was looking for when I visited the article was a link or lead towards the smallest known undecidable seed for the game. Or is it impossible to know for sure if any particular seed is actually undecidable? In that case, I guess I'd try to reword the question in terms of "How big is the smallest seed which is suspected of being undecidable?" Shanen (talk) 02:59, 4 May 2023 (UTC)[reply]
I don't think your question makes sense if by size you mean the area of its bounding box. For any size you name, there are only a finite number of patterns, all of which have some fixed fate that can be stated by an algorithm, for instance one that hardcodes a list of these patterns and their fates. So nothing can be undecidable. On the other hand, if you mean the number of live cells, it's at most 65: every glider-constructible pattern can be constructed using at most 15 carefully-placed gliders, and that includes families of patterns (not individual patterns!) with undecidable fates. See e.g. the note in https://conwaylife.com/wiki/Category:Patterns_constructible_by_a_given_number_of_gliders . But that's not a reliable source by Wikipedia standards, so we would need something better than that before we can state anything about this in our article. —David Eppstein (talk) 06:59, 4 May 2023 (UTC)[reply]
level-5 vital article is rated B-class on Wikipedia's content assessment scale.
