|
- Prove that the set of recursive languages is infinite
I know that set of all deciders is countable I am wondering whether it is infinite In other words can we prove that the set of recursive languages is infinite ? Edit : The above question has small
- Brainf**k to Unary and Back - Code Golf Stack Exchange
Example: + would become 000000000000000000000000000000000000000000000000000000000000000000000000000000000000 which is 84 zeroes brainfuck → Unary specification: Since the resulting programs will be impossibly huge, print not the actual program but merely the length of the resulting program
- All you have to do is print the number 1! . . . Twice
Your task In your language of choice: create a program that outputs 1 This 1 may either be a string or value equivalent to the number one The shifting catch If you take the unicode codepoint (or
|
|
|