Category talk:Unknown computational class

i think this should have a sub category for things that have a high chance of being TC and must be at least close to it. like esolangs that has a Looping counter made in it Yayimhere (talk) 05:36, 7 September 2024 (UTC)

One difficulty with that is when considering e.g. the structured-programming theorem, which is very discrete. It's hard to approach Turing-completeness incrementally. Another difficulty is that we usually want constructive proofs, which means that we want a concrete example of a universal interpreter. Also consider that being Turing-complete is easy and what we really care about are the non-TC systems since they are easier to analyze. Corbin (talk) 13:14, 7 September 2024 (UTC)

its still pretty annoying if you e.g are looking for a esolang to maybe prove its computational class its kinda annoying when it basically already known