All public logs

Combined display of all available logs of Esolang. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 09:57, 5 October 2025 U talk contribs created page I (Created page with "using 2 0. op: if increased first is 0, second is increasing. at end first will be divided on second. interpreter on c(z: unsigned 16bit number of ops, after z= is it, memory(x and y) is signed 8bit):const unsigned char main(void){{char x=0b0,y=0b0;{unsigned short z=;while(z){x++;if(!x)y++;z--;}}x/=y;}return 0b0;}")
• 10:39, 3 October 2025 U talk contribs created page Fraction (Created page with "x=0, y=1. 1st op - increasion of current cell. 2nd - jump from x to y. finally getting x/y. interpreter on C(1st op as 0, 2nd as any other, after ] must be =[, ops through , and ] at end): const unsigned char main(void){{const unsigned char A[(unsigned char)0];unsigned char B=(unsigned char)0;char C=(char)0,D=(char)1;while((unsigned char)B!=(unsigned char)sizeof((unsigned char)A)if((unsigned char)A[(unsigned char)B]==(unsigned char)0)C++;else D++;const char E=(char)(char...")
• 08:46, 3 October 2025 U talk contribs created page IBSE (Created page with "Op increasing A, equalizing B to A and if A-B<B while so decreasing B. C interpreter:const unsigned char main(void){{char A=(char)1;char B=(char)1;for(unsigned char C=(unsigned char)0;(unsigned char)C!=(unsigned char)0;C++;){A++;B=(char)A;do{B--;}while(((unsigned char)C!=(unsigned char)0)||((char)(char)A-(char)B<(char)B));}}return (unsigned char)0;}")
• 12:07, 27 September 2025 U talk contribs moved page Why isec is turing swamp? to Isec TC proof
• 09:49, 26 September 2025 U talk contribs created page Why isec is turing swamp? (Created page with "All x=1x, and x+y=1x+1y. So as that, multiplication(set of self addition) is also here. So as even integer memory measuring naturally, local nega/positivity is a path to use memory, what determining by memory mean. So as it, set of additions is leading to inversion. So as it, if x and y>0, x-y=-(lower memory limit+(-lower memory limit-x)+y). If x<0, x-y=-(-x+y). Multiplication and addition is here. Division on 2 is doing automatically, and division on 2^x is getting from...")
• 09:47, 25 September 2025 U talk contribs created page File:Final.jpg
• 09:47, 25 September 2025 U talk contribs uploaded File:Final.jpg
• 07:51, 25 September 2025 U talk contribs created page File:Right.jpg
• 07:51, 25 September 2025 U talk contribs uploaded File:Right.jpg
• 13:28, 24 September 2025 U talk contribs created page File:Division.jpg
• 13:28, 24 September 2025 U talk contribs uploaded File:Division.jpg
• 11:09, 23 September 2025 U talk contribs created page Isec (Created page with "isec is an PL with 1 op of memory incrementation. At last, memory'll divided into 2. isec interpreter on BF(instead of op was accepted BF-incrementation, at start must stay needable number of +) is a [-->+<].")
• 10:15, 23 September 2025 User account U talk contribs was created