This topic was closed as unclear. However, all asked problem in the comment that matter seem answered in the first version statement.
1. The result should be constant when n exceed a constant. 2. Decimal and unary(use the output.length) output allowed 3. No infinity output, but infinite loop allowed if the loop doesn't generate any output, or the infinite output is after a decimal point. 4. You can assume sizeof(a number type) be its size on some existed env or linear to 2^n with an existed rate. That means, long long in C++ can be 4 bytes(16-b env), 8 bytes(32-b env), 2^n bytes(64-b env), 2*2^n bytes(32-b env). However, if char* is 4-byte or 8-byte, it can only handle 4GB memory or 2^64 byte memory, and the result won't be that large. 5. For float(and double), you can define your custom IEEE bit arrange, sizeof(float)=2^n, sizeof(double)=2^(n+1) 6. Unlike other models, with n treated as a large enough input, this model can solve something like the busy beaver. Therefore, you may want to go further. a. I only answer "What the problem mean", not "Why ask this problem"(The latter usually don't apply in PCCG)
It's very unclear to me what the challenge is actually about. Given a 2^n-bit x86: Is this an assumption about computer architecture? Some kind of input? What is n? output the largest result when n is large enough: Large enough for what? [a] A busy beaver maximises some property of the computation model (e.g. execution time, memory usage, output length) subject to the constraint that it must halt. From Note 3 I don't even think it is a busy beaver (because infinite loop is allowed). And when n is large enough, does this imply unlimited precision? [3&6] What do you want to say? I don't understand. / What about the program unsigned n=1,p=0;while(n>p){++n;++p;}print(p); which prints the largest unsigned value?[1] So what's the difference between this and the other challenge? Any program from the other challenge can be ported to this challenge and remains competitive.[6]
This one was closed(later reopened) also as unclear, for they didn't know the statement's truth value is unknown. However, the first version directly says
you shouldn't just say "one of E x x=x and A x x>x match"; but if you proved one, you are allowed to use that XD
Therefore "unclear" seem doesn't mean "don't know what the question mean, and thus unable to answer". So what does it mean?
1/eps
only matter with k). When problem bugged what is that? \$\endgroup\$