627,421,742,590,461,754
or
0x08B5_0CC0_2B76_073A
in case someone would like to memorize it or something.
Everything else is word play.
> Precisely because the Turing machine model is so ancient and fixed, whatever emergent behavior we find in the Busy Beaver game, there can be no suspicion that we “cheated” by changing the model until we got the results we wanted.”
Ultimately you seem to pick a random definition of computing and size and then work with that?
B0 39 mov al,'9' //load character '9' to AL
CD 29 int 29h //print to screen
EB FA jmp short -6 //go again 0?9:RUNThe (implicit) rules of the game require the number to be finite. The reason for this is not that infinity is not obviously "the largest" but that the game of "write infinity in the smallest number of {resource}" is trivial and uninteresting. (At least for any even remotely sensible encoding scheme. Malbolge[1] experts may chime up as to how easy it is to write infinity in that language.) So if you like, pretend we played that game already and we've moved on to this one. "Write infinity" is at best a warmup for this game.
(I'm not going to put up another reply for this, but the several people posting "ah, I will cleverly just declare 'the biggest number someone else encodes + 1'" are just posting infinity too. The argument is somewhat longer, but not that difficult.)
0=your largest number 1=your largest number + 1
[1] https://en.wikipedia.org/wiki/Berry_paradox
[2] https://terrytao.wordpress.com/2010/11/02/the-no-self-defeat...
masfuerte•1h ago
In my representation the bit pattern 00000000_00000000_00000000_00000000_00000000_00000000_00000000_00000001 stands for the number w218+1.
I win!
tromp•1h ago
Sorry; no winning for cheaters:-(