@Pavel I couldn't see the individual pixels anyway, so I didn't care much about resolution :) I'm much more worried about keyboards - they are worse today than 10 years ago.
@ASCII-only It's fine, thanks. I did recently go on to my old monitor and was appaled by the size of the text. I guess it's just something that you get used to
@orlp So, if we compute g(x) for some vector x that's a k-tuple of inputs, and add that g(x) to the original set of inputs, we have a problem of size j-1?
ok idea: language with 3 stringly typed registers, but the only way you can do any comparing of these registers, is checking if they've been activated (if you have the string "blah", you can activate it, and if you then have a string "bla", which you then add h to, you can check if it's activated, and conditionally do an operation)
or with numeric registers. or both
I think it might be interesting to prove the turing completeness of it
although, if you can delete characters, could it be easily reduced to a minsky machine?
In my recent challenge, the task is to generate an output including the language name, and then generate an error (in two different languages).
Regarding the "language name", I used the following rules (since someone mentioned that another challenge was closed due to the "language name" being un...
why is meriam webster such a crap dictionary though (at least in the thesaurus)
it doesn't have a section in the thesaurus for "to examine the character or qualities of especially in order to discover resemblances or differences". like the main definition imo
Different system has different way to describe colors. Even all of them are speaking in R-G-B-A space. A front-end developer who familiar with CSS may prefer #RRGGBBAA. But Android developers may prefer #AARRGGBB. When handling AAS file format, #AABBGGRR is needed. That's too confusing. Maybe we ...
@ASCII-only Yes, that's the point. You need to have an infinite family of programs (infinitely many possible values of the comment) with the same functionality to be able to do that.
(e.g., SKS Add 2 numbers, Hexagony Truth machine, Wumpus Third time the charm)
A self number (also called a Colombian or Devlali number) is a natural number, x, where the equation n + <digit sum of n> = x has no solutions for any natural number n. For example, 21 is not a self number, as n = 15 results in 15 + 1 + 5 = 21. 20, on the other hand, is a self number, as no n can...
Write a program that takes a string as an input,
if the ASCII representation of the the last char is even, it returns all chars who's ASCII representation is even (in order) or return the string as is if the ASCII representation of last char is odd.
... Interesting. If d is a dict, list(enumerate(d)) == list(enumerate(d.keys())). Obviously the latter way is easier to read.
Although, it's pointless, as Python dict is randomly ordered doesn't guarantee any order. (just based on their hash, which is implementation dependent)
Alice (A) and Bob (B) decided to have a battle.
Each combatant has 10 health.
They take turns to roll a die 6 for damage.
That damage is removed from their opponent's health.
In the end either Alice or Bob, will vanquish their foe.
Show me how the battle went. Outputting these codes for the ...
The picture below shows a baby rattle. The circular tube hangs vertically, with the balls being on the bottom. Here's a gif showing how the balls move.
They are rolling freely inside the tube (other's have confirmed that they see the balls rolling too)
The inner diameter of the tube is larger t...
I couldn't find any consensus on this on meta for a while, and this seems to be particularly helpful when answering decision-problems. Should swapping truthy and falsy be allowed by default, when answering such challenges, or should we let the OP of the challenge decide?
For example, when testin...
Self-limiting lists
Consider a nonempty list L containing nonnegative integers.
A run in L is a contiguous sublist of equal elements, which cannot be made longer.
For example, the runs of [0,0,1,1,3,3,3,2,1,1] are [0,0], [1,1], [3,3,3], [2], [1,1].
The list L is self-limiting if for each integer N
I did realize you were replying to me, but I wasn't able to see it :P (when you delete a comment the notification gets automatically removed btw, no need to apologize ;) )
As described in this question:
Dropsort, designed by David Morgan-Mar, is an example of a linear-time "sorting algorithm" that produces a list that is, in fact, sorted, but contains only some of the original elements. Any element that is not at least as large as the maximum of the elements pr...
Dropsort, designed by David Morgan-Mar, is an example of a linear-time "sorting algorithm" that produces a list that is, in fact, sorted, but contains only some of the original elements. Any element that is not at least as large as the maximum of the elements preceding it is simply removed from t...
This challenge already describes dropsort. However, I'm kinda lazy and I really only need my array to be a bit more sorted than before, it doesn't need to be sorted all the way.
In Drop Sort, we drop every element less than any element before it. In Lazy Drop Sort, we drop every element less tha...
@Pavel I know of partition, but most tutorials/guides I can find told me to dd if=....iso of=/dev/sdx (not /dev/sdx1 or something like that) so I'm not sure.