@RadvylfPrograms Most of the time it's usually done by turning a computer duster upside-down and spraying the extremely cold mist on the memory sticks, although a lot of modern cold boot attacks don't do that and instead do a cold reboot into a custom OS with a low memory footprint which then dumps memory. In one case, the BIOS was modified to contain a custom coreboot payload that exfiltrated memory over serial! Liquid nitrogen is usually overkill.
@Bubbler I don't think that'd be a huge issue, since you're limited to n+2 registers if you're using n instructions (and for any practically useful algorithm it'd probably be less than n), and any solutions that're using beyond like, a couple dozen registers are probably not going to be competitive.
@RadvylfPrograms (I would've defaulted to float jump-if-zero to stick with the precendent of prefixing i for the int ones, but I decided jiz wasn't a great opcode name)
doing some optimality theory homework about factorial typology, and since we're making a point of not really considering domination relations with no observable effect, it occurred to me that the actual rankings we're talking about are a bit more than factorial and then i realized there's *definitely* some challenge we had here on main about sequences which start with 1 then build rightwards with any n only being permitted if n or n-1 is already in the sequence but i cannot remember what it would be called
A Young diagram is a rectangular binary mask whose every row and every column are sorted in descending order.
It is easy to check that every rectangular binary mask can be formed by xor-ing together a finite number of Young diagrams.
This decomposition is by no means unique, but there will be a m...
Let \$ A \$ represent the alphabet, such that \$ A_1 = \$ a and \$ A_{26} = \$ z.
Let's define that a word \$ W = w_1 w_2 ... w_n \$ (where \$ w_c \in A\$) is in standard order if and only if:
\$ w_1 = A_1 \$, and
for \$ 2 \le i \le n \$, if \$ w_i = A_x \$ then \$ w_j = A_{x-1} \$ for some \$ j <
the problem is more like, some single-byte builtins are suddenly golfier than the others, which forces you to think about tradeoffs not considered when designing the language
i'd probably stick with jelly until a more utf-8-friendly substitute with otherwise similar syntax and builtins rolled in
because some builtins would be inordinately expensive and while there might be a bit of fun to be had figuring out which are actually sometimes not worth it it would get old fast
My first attempt to this, a relatively simple solution. It fires a couple of glider barrels. Each pair of gliders turns into a block, which then form the text. This process takes about 16000 generations (you can set a frame skip or use the superstep button in my simulator).
Direct Link. Move aro...
This began as a quest but ended as an odyssey.
Quest for Tetris Processor, 2,940,928 x 10,295,296
The pattern file, in all its glory, can be found here, viewable in-browser here.
This project is the culmination of the efforts of many users over the course of the past 1 & 1/2 years. Although the ...
Tetris is different because there is singificant amount of logic other than IO, so even if the IO required is extremely specific the result is still impressive
Why not try another cellular automata like wireworld? It's similar to GOL but makes it a lot easier to store things thus say "the value in this register is the output"
Speaking of cellular automata... I was thinking of an idea where each cell has color, in 3 parts, red, green, and blue. Each cell sets all 4 diagonal cell's red component to its red component, north and south cell's green component is the center cell's green component, and for east and west cell's blue component is the center cell's blue component.
But I'm trying to figure out to create peace in an overlap
@mousetail then mark Valentine's of next year. I should be done by then
"Each cell sets all 4 diagonal cell's red component to its red component, north and south cell's green component is the center cell's green component, and for east and west cell's blue component is the center cell's blue component."
@py3_and_c_programmer But why create these rules if you think are so boring? Why even think about them? Of course you may have a idea but find out later it's bad but then you can just discard it and stop thinking about it. Or you can think it's "nearly" interesting but you just need to change it a bit.
Well I can't even play tag cuz I'm so nerdy there are legends about a boy who can play games during class for the whole semester and yet get 100/100 in his math exam and finish it halfway through
Write a script, program or function which takes one input of type string and outputs or returns some sort of indication wether the input string was 'hi whats up' (without the apostrophes) or not.
You can for example return true if it was and false if it wasn't. Or print something to the screen, l...
@NewPosts I know that practically this wouldn't work, but sometimes, I really want a generic "do X without Y" challenge that I can use as a dupe hammer target
Draft challenge: I know this is a bit open-ended, but here goes: Choose a task and a source code restriction (remember to state what they are!), then solve the problem while abiding by the restriction, using your language of choice.
We'd immediately close it as too vague, but then we can use it as dupe hammer target.
@mousetail yeah, + should work as well. I guess Sp3000 wanted to leave open the possibility of also pushing negative numbers to the stack before execution