Note: we had a similar discussion a while back, but the scope of this question is slightly different and aims to provoke action rather than just being a discussion.
Most questions currently tagged with kolmogorov-complexity fall into one of these categories:
Challenges about producing a fixe...
Is this a triangular number?
code-golf decision-problem number
Given a positive integer, determine whether it is a triangular number, and accordingly output a truthy/falsy value, or any two constant, distinct values.
Definition
A triangular number is a number that can be expressed as the su...
Introduction
Unlike English, German is considered to have quite a phonemic writing system. That means that the correspondence between spelling and pronunciation is close. Given any word you aren't familiar with, you would still know how to pronounce it because of the spelling system. This means ...
Brain-Flak, 230 bytes
([]){{}({}[()]<>)<>([])}{}<>([]){{}({}<>)<>([])}{}<>({<({}<>)<>>()}<(())>){({}[()]<<>({}<>)>)}{}(([])<{{}(({})())({<{}>{}((<()>))}<{}{}>)({}<>)<>([])}<>>){({}[()]<({}<>)<>>)}{}<>([]){{}({}<>)<>([])}{}<>{}{}([]){{}({}<>)<>([])}{}<>
I will explain soon but my mom cooked me ...
I feel like sharing this because I am very proud of my answer
Well since I don't need to backtrack it should be easier. Is brute-forcing all 2**(n**2) configurations allowed? :D [I know it's not :(]
user165474
Let there be a circle of 5 ones and 4 zeros, in any order. Then, on each iteration, replace each digit with the inverse of the XOR of the digits on either side of it (also just iff). Prove that you will never reach a state of all zeros.
Code that never finishing running on challenges that need finite output
If you try to brute force a code-golf challenge to save bytes the code must run and compile without crashing. If you can't run it without crashing on the largest or have another user verify that it does your answer is invalid.
Code that never finishing running on challenges that need finite output
If you try to brute force a code-golf challenge to save bytes the code must run and compile without crashing. If you can't run it without crashing on the largest or have another user verify that it does your answer is invali...