@LuisMendo I'm not really sure how those (arguments) are parsed in tio/nexus for J. For input, you can call stdin to receive the entire input until EOF as a string.
@flawr Given any infinite set, construct another set whose members are all of the subsets of the original. This new set is strictly greater in cardinality than the previous one. This means that for any infinitely large set, you can construct another set that's even larger.
@El'endiaStarman Well I just wanted to point out that I actually don't know too much about some subjects that are talked about here, and perhaps some others here might not either:)
@El'endiaStarman BTW: did you read the thing about the sequences and limits?
Mini-Flak, 6900 bytes
Mini-flak is a Turing complete subset of Brain-Flak. It works exactly like Brain-Flak except the [], <> and <...> operations are banned from use. Programming in Min-Flak is thus much more difficult than traditional Brain-Flak.
The main difficulty with Mini-Flak is the la...
At least in german there is the clear distinciton (in math) between "Folge" and "Reihe" but in everyday language both can more or less be used interchangeably.
I just noticed that the notion all but finitely many seems to be much easier to understand than the formalized for every epsilon there is an N0 such that...
@DJMcMayhem I like silver so much better:)
@DJMcMayhem For I while I held the title of "highest rep user without gold badge" :D
rules question: suppose a language has two different syntaxes for an array of integers, and they are treated differently by the language (builtins act one way on arrays that were produced by one syntax, and another way on arrays that were produced by another syntax); does requiring one or the other syntax to be used count as a reasonable input method?
@ConorO'Brien idk if I've already asked you (if I have I don't mean to nag you), but can you pls do docs for functional stuff in cheddar :3? If you don't to that's fine
@Downgoat btw idk if I asked you but I feel like there should be special functional ops that are higher precedence than their overloaded equivalents, e.g. @@ is the same as +
The problem
Generate the largest array filled with numbers (largest being typing array.length or your language of choice's equivalent) then print it. As in send the command to the computer to print the array. You would cause the box for hitting Ctrl+P or OS equivalent to pop up and the preview w...
Is there a trivial esolang solution to: Write the longest N-char program possible that outputs N, but when the index-I char is removed, the output is I? e.g. N = 3: ABC would output 3, BC outputs 0, AC outputs 1, BC outputs 2
nah, this is a really interesting level of difficulty
people should post these "it seems impossible" challenges more often
my n=3 radiation-proof quine was really fun to write (i.e. you can delete any three characters and it still prints the original string)
the author thought that would be impossible for n>1, and in fact nobody found one for ages
but the mere existence of the challenge was a lot of fun
in other puzzle- and quiz-oriented sites I've been in, there's been the occasional "almost impossible challenge"; often they never get solved, but they're fun to work on
it is considered to be courteous to place a warning about how difficult it is though
here, that's less important, people can normally tell
(the other thing about the "very hard challenges" is that it's common to get collaborative attempts at a solution)
can anyone read this and figure out the letter, my tired brain can't understand what this says
XX XXXX XXX X X XXX XXXX XXX XX XXX XXX
X X X X X X X X X X X X X X X X
X X XXX XXX X X X X X XXX X X X X
XXXX X X X X X XXX X X X X XXX XX
X X X X X X X X X X X X X X X
X X X XXX XX X XXXX XXX XX X XXX
have there been any challenges like that yet? (given a medium-sized list of large keys each of which is associated with a small value, take a key as input and print the value; you can assume that the key is valid)
I am not sure if this is the right place to ask, but people in the h-bar chat didn't reply. Just a question regarding crystal field theory: why does the crystal field splitting energy increase as we go down a group with the same oxidation state?
Is it simply because the atomic radius increases, the d-orbitals are closer to the ligands in a complex and thus there is a greater electron repulsion in the octahedral electrostatic field, meaning that the electrons in the d-orbitals will be displaced by a greater amount resulting the crystal field splitting energy to be greater?
@EᴀsᴛᴇʀʟʏIʀᴋ I tried to look up the reason on the internet but could not find it, and so made a hypothesis based on periodic trends, electron configuration and crystal field theory.. lol
What does that monster look like?
code-golf
In the computer game NetHack, there are lots of monsters to fight. The position of each visible monster is shown on the game's map via the use of a single ASCII character; for example, a giant ant is shown as a, an acid blob is shown as b, and a chick...
idk much about it but I'd tend to trust the one with the most stars and downloads (and no issues). Major problems with it would have been noticed by now. Not saying your is bad but maybe they had reasons for coding it like they did.
@Dennis what happens if you run it inside unshare -pUfr? that's creates a kind of vaguely sandbox-like object, but the most interesting feature it has is that any programs inside will believe they are root
Unhandled Exception: System.Reflection.TargetInvocationException: Exception has been thrown by the target of an invocation. ---> System.TypeInitializationException: The type initializer for 'System.Management.Automation.PSVersionInfo' threw an exception. ---> System.IO.FileNotFoundException: Could not load file or assembly 'System.Diagnostics.FileVersionInfo, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a'. The system cannot find the file specified.
---> System.IO.FileNotFoundException: Could not load the specified file.
@ais523 Not as far as I can tell. (That dotnet tarball I downloaded from Microsoft even gave ownership to the sandbox user for some reason.) All files in /opt/microsoft and /opt/dotnet are world-readable.
But the SE system really isn't geared for PPCG. "Hey this answer is short, so it's probably no good." No, SE, it's an answer to a code golf challenge. Being short is kind of the point.
Well we have 3 years remaining on your "4 years to design/site-specific features" so we're a almost a quarter way to having your site-specific solutions
First world problem: one of those rubber bits on my keyboard fell off, and now my keyboard is sliding a lot and makes a lot of noise while typing because it's unbalanced
Mini-Flak, 6900 bytes
Mini-flak is a Turing complete subset of Brain-Flak. It works exactly like Brain-Flak except the [], <> and <...> operations are banned from use. Programming in Min-Flak is thus much more difficult than traditional Brain-Flak.
The main difficulty with Mini-Flak is the la...
What does that monster look like?
code-golf
In the computer game NetHack, there are lots of monsters to fight. The position of each visible monster is shown on the game's map via the use of a single ASCII character; for example, a giant ant is shown as a, an acid blob is shown as b, and a chick...
