Internal Truth Machine code-golf
It's a normal truth machine but instead of taking input, it uses the first character of the program. Thus, internal.
Example: 0abcd prints 0 and halts, and 1abcd prints 1 infinitely.
The Challenge
Write two programs P and Q such that:
P and Q are written in the same language
The output of P is Q
The output of Q is P.
Simple enough. Surely that's been done here before. Where this gets interesting is the scoring.
Scoring
P and Q are selfish, they don't want to sheir the...
It's a normal truth machine but instead of taking input, it uses the first character of the program. Thus, internal.
Example: 0abcd prints 0 and halts, and 1abcd prints 1 infinitely.
Of course, you're not allowed to look inside the file itself.
@Anush If you can get away with floating-point numbers, use the closed-form formula a(n) = ((1-sqrt(2))^n + (1+sqrt(2))^n)/2; if you're restricted to integers (e.g. large term modulo some number), use matrix exponentiation by squaring.
The chain seems to have begun with Martin and Alex, then a lot of users gradually reduced activity/disappeared.
Although some were gone long before that, I mean, just look at the first 50-ish users by all time reputation and see how many are still active. The result is depressing.
Internal Truth Machine code-golf
It's a normal truth machine but instead of taking input, it uses the first character of the program. Thus, internal.
Example: 0abcd prints 0 and halts, and 1abcd prints 1 infinitely.
The Challenge
Write two programs P and Q such that:
P and Q are written in the same language
The output of P is Q
The output of Q is P.
Simple enough. Surely that's been done here before. Where this gets interesting is the scoring.
Scoring
P and Q are selfish, they don't want to sheir the...
