From Esolang
Jump to navigation Jump to search

This is very interesting. The only thing that seems to be known is that an infinite number may generate an infinite amount of subprograms. If we chose n in 2n large enough we could generate a chosen amount of subprograms. For this reason it may also be of interest to study the behaviour of programs of the form 2n. A number 2n will be divided by 2 n times, generating a sequence of n numbers. Because Bueue works with the decimal radix (if you had chosen to convert the number to binary, one could I think more easily write programs in this language, but there would be less features), it may be a better idea to use powers of 10 though. Since 10n = (2 * 5)n = 2n * 5n, a program of the form 10n will first generate n sub-programs, and then will generate as many sub-programs as generated by 5n. For the latter we can again not predict much, although the former may allow us to predict the first part of the actions of a given number. --AnotherTest (talk) 13:17, 17 February 2013 (UTC)

The example programs are flawed, really: this would be true if it printed the direct bits as output, but it doesn't. In both cases the queue has a length less than 8 and so nothing is printed.

The smallest number that outputs a full byte is 15, which prints 11100010. 31 prints some characters and 36 prints 兩 . The first number that yields something sensical is 37 which gives 't'. I'm gonna keep looking... Imaginer1 (talk) 16:43, 20 September 2014 (UTC)

Hm? 11000011694 enqueues 8 bits, 6 flips the first bit and 9 prints those 8 bits as a byte. -- Feuermonster (talk) 11:34, 24 September 2014 (UTC)