Zwei

(also, interestingly, the TI-basic encoding seems to be variable-length, a few tokens seem to use 2 bytes)

the debate at this point is as follows: should the header and filename be included in the total byte count, or should we subtract these from the displayed value

I think this observation is good progress towards resolving the TI-basic byte counting conundrum

appears to be 9+name length+contents of program

the number to the right of the program name is total file size in RAM

from home screen: mem -> 2 -> 7

calculators supporting TI-basic have a built-in byte counter

it's pretty much THE np problem next to graph coloring

boolean satisfability problem

facekeyboards

how would SAT solvers handle 128 variable and probably million+ operation problems

@ATaco most interpreters map [0,256) to the chars, so it's easier to think of that way

limited memory is why nothing is truely turing complete

^

yes

unsigned 8-bit integer

so not really

most interpreters use uint8_t

anyways, with the fixpoint for md5 problem, brute force is obviously impractical over 128 bit unsigned int...

if the right cell is 0 but the left isn't it won't terminate

no, the left cell has to be 0

anyways, I'm thinking of taking a stab at the currently open problem: does there exist an x such that md5(x) = x

I'm pretty sure python has ints

for me at least, I don't follow lua much but when I worked with it back in 5.2 it was double-precision floats and nothing else

that's a recent development

even if you think you're on integers

a lot of dynamic languages such as lua will never use anything other than floats

oh

what language I mean

what interpreter are you using

as that finitely negative number -1 cannot be represented via floats

either that or the granularity of floats away from 0 will keep it from decrementing at a finitely negative number

I figure it would go down to -infinity and repeatedly decrement staying there

with floats (which js works with) you have +infinity and -infinity

cin is only safe against strings, but the programmer used a char[] buffer for some reason

this programming language says it's unusable but I think a buffer overflow exploit is possible

esolangs.org/wiki/Tautology

beautiful

const int ONES = 0x3fe; // Binary 1111111110

this is harder to read than many golfing languages

looking at it more closely, what the hell

that's a pretty good program for being written by a prime minister

well, there is 0x01 to increment and something else to decrement but that's it

V doesn't even number

more powerful as in V does

ah

java, c# low tier, cjam mid tier, jelly and 05AB1E top tier?

so like

bits*

if the program can be completely expressed as 01000110 10000110 10, and a theoretical "BLC machine" could read and understand this perfectly, the requirement to add 6 null bytes seems arbitrary