@thejonymyster Basically, you can make a language whose interpreter runs any arbitrary code before starting. So, you'd have to prove that that code halts for the language to be TC, since if it didn't, no code would ever get run
@emanresuA Exactly. I'm demonstrating why you can't write a program in a TC language that can prove any language is either TC or non-TC in a finite amount of time
@BetaDecay i'd like to think i've gotten rid of most of my bad habits but maybe that's just cuz i use a code formatter and my code itself is still just as bad
A Steiner quadruple system \$SQS(n)\$ is a collection of subsets (blocks) of size 4 of a set \$S\$ of size \$n\$ such that every subset of \$S\$ of size 3 is in exactly one block. It is easy to show that the number of blocks is \$\frac14\binom n3\$ and that a necessary condition for an \$SQS(n)\$...
@DialFrost There are some complicated edge cases, but essentially that's right, you don't get rep past 200 on any given day, and any rep above 200 that you would have gotten does not appear later.
Gallup runs a variety of opinion polls. In August of 2017 and again in August 2018, they asked survey participants their feelings on the computer industry.Simplifying the results a bit: in 2017, 59% of those surveyed said they had positive feelings towards the computer industry. But in 2018, that...
In this case, with the combination of kolmogorov-complexity and open-ended-function, I think a requirement of "You must run your code to completion and include its output in your answer" makes a lot of sense.
So if somebody is patient enough to let their code run for a week, they can, but 100-billion-year solutions are out.
The actual example I included was found using Gurobi by imposing symmetry constraints. It took less than a second to find it, but then a few minutes to get it formatted nicely as orbits + permutations