Sandbox posts last active a week ago: Make a braille cribbage board

CMC: Shortest program that terminates normally locally but would overflow TIO or ATO's output buffer

Vyxal, 3 bytes: 4(↵. Prints 10^10^10^10^0 = 10^1e10, or a number that needs 10GB of space to print. It'd take a while but it would terminate within at most a week, assuming it had sufficient memory

On a more reasonable note: k¹ṗ - all subsets of the consonants, or a list with 2^20 ≈ 1e6 items where each item is on average 10 bytes, + 5 for delimeters, so about 15 megabytes

Only took 30 seconds to run locally

Technically nṗ (all subsets of the lowercase alphabet) works for 2 but it'd print 2^26 * (26/2 + 5) = 1.2GB, and by extrapolation would take about half an hour

Segfault Vyxal in 5 bytes!!!

That's... not a segfault

If you really want a recursion error then λx

@emanresuA I thought RecursionError was a segfault?

Recursion errors are usually recursion errors, and so forth

hello all!

@TheEmptyStringPhotographer segfaults are usually when you try to access a null or invalid pointer iirc

@Seggan But the C compiler segfaults when the main function calls itself.

My sandbox post has been in there for about 42 hours, and it has 4 upvotes. Would it be ok to post, or should I wait another 30 hours?

How long shall I leave a question unanswered before I pose it in another SE site?

@TheEmptyStringPhotographer that's a pretty good rate of upvotes!

@Simd I don’t think people like other people crossposting.

@TheEmptyStringPhotographer I think that's when there is a small gap in time

@Simd what sort of question is it that it would be relevant on multiple sites?

@TheEmptyStringPhotographer Segfault is a memory error, you can't segfault by overflowing the stack

At least as long as a recursion limit exists

apparently you can only set the python recursion limit as low as 4 without it complaining. I wonder if that breaks any of the builtins

@Simd You can post them immediately, just disclose it and link them

@JoKing my fastest algorithm question

@Simd i think it's unlikely to get a good answer on Stack Overflow if you were going to ask it there

Go to a university and see if anyone still needs a topic for their thesis

@noodleman I was thinking math.se

@mousetail but what if it is impossible?

Wouldn't proving it impossible make an even better thesis project?

@mousetail yes but I have no idea how to do that

You can't give someone a project if they might get nothing from it

They have no obligation to pick your project, but you could suggest it to them. Lots of students have a lot of topic picking thesis topics and maybe one of your algorithms will interest them, maybe not.

Especially if it's a low level thesis (bachelors) you don't necessarily need to get results to pass

@mousetail what would be in their thesis if they don't get any results?

Explaining all the methods they tried and why they don't work

Interesting

I'll leave it a week before I do anything

Maybe someone here will have an idea

There have been dozens of papers published on unsolved problems like P=NP and 3n+1 but neither have been solved yet.

What is 3n+1?

Colatz Conjecture

Ah ok

There is a >0 chance of an answer here of course

@Simd Code Review might be a good place.

@TheEmptyStringPhotographer what would that be good for?

That is for code review

What code are you thinking needs reviewing?

@Simd Code Review can review your code to see what makes it slower and help you optimize it.

@TheEmptyStringPhotographer I don't have code I want to speed up

That's the challenge

@Simd Starting with some un-uptomized version would be very helpful no matter where you post it. Often I include example code with my challenges here. Even if you decide to post on mathoverflow or CS they'd appreciate some example code

@Simd I got a bit confused I guess…

@mousetail what do you think that could be in this case

@TheEmptyStringPhotographer no problem. Happens to me a lot!

@Simd Just brute force?

@mousetail Would something like 2 days and 12 hours be fine? (e.g. I post in the evening, then a 2 day gap, then I post in the morning.)

There is no rule saying you have to use the sandbox or how long to wait, but just if you wait too short and it turns out it's unclear you have less to defend yourself with. However, some posts with lots of points and time in the sandbox are also still unclear or duplicates so it's really up to you if you think a post is ready or not

@TheEmptyStringPhotographer that's a probably a buffer overflow, not a recursion error

@mousetail hmm...I guess so!

So you know how Rust has features and C and C++ have #define/#if(n)def? I have a language that doesn't have that sort of thing to enable features at compile-time, but I want to do it anyway

How bad of an idea would it be to use a macro that accesses environment variables set when the compiler's called to get the same effect?

That's a reasonable method I think

i'm about to sandbox a kolmogorov-complexity graphical-output challenge. how should i specify the image's proportions?

the image is Prince's symbol

which doesn't seem to have clear proportions defined, and is almost wonky

should i just specify some things that the image should clearly have, and leave other details up to whatever is shortest?