1:43 AM
0

This challenge is from a game, Keep Talking And Nobody Explodes. It's hard to say how this mechanism works. The engineering is pretty impressive, but there must have been an easier way to manage nine wires. — from the manual Input Exactly 9 "wires", each which is labeled 'A', 'B', or 'C', and is ...

3 hours later…
4:20 AM
0

We've decided to revive the Language of the Month event. We've also decided to start a new post for nominations. (You can see the old nominations post here.) So let's get to nominating! Note: We may start with the old post's top nomination, R, as the Language of the Month for September 2020. Go h...

3 hours later…
7:00 AM
I call China "my country" because I lives in it, since around 2018.

@HighlyRadioactive I think people who can't use subject-verb agreement well are definitely not native speakers.

3 hours later…
9:42 AM
@RedwolfPrograms It's a miracle that I managed to get to 64 on that

6 hours later…
4:08 PM
@DLosc I'm trying to pad a binary number to it's 16 bit representation, but this isn't giving me the output I want. tio.run/##K8gs@P9fwzDK3dBMVznEKVFTTwNEcv3//9/EyMQIAA A little help here?

4:30 PM
0

The problem is as follows. Input: An integer n Output: The smallest prime (or probable prime) bigger than n. The challenge is to give the fastest possible practical code to do this. Past questions have asked about a theoretical machine with infinite computing power, or have restricted it to 10 se...

2 hours later…
6:47 PM
@Razetime The main issue is that you're trying to put a list together with a string, and the . operator vectorizes over the list. You can use the -d flag to get a little more insight into what's going on: TIO
ZG returns a matrix (a list of lists), so 1ZG3 is giving you [[0;0;0]], and then TBa gets concatenated to the end of each of those zeros.
What you want instead is X, the string repetition operator: TIO

Hello!

Hi!

2 hours later…
8:54 PM
0

Balanced Beams Here are some examples of beams that balance: X Y A | X Y B Y --+-----+---+---+ | | | X X Y Y Y X X --+---- ----+-- + A X X Y | A B Y Y +---+---+-+-----+ | | | | B A | A AAB B A + --+-- --+-- + X Y X X | Y B X +-+-+---+---+---- | | | | Y A ...

Any final feedback on this challenge?

9:33 PM
@cairdcoinheringaahing I commented.

9:44 PM
0

Implement the random Fibonacci sequence The random Fibonacci sequence is defined as follows: $$f_n = \begin{cases} f_{n-1}+f_{n-2} \text{ with probability } 1/2 \\ f_{n-1}-f_{n-2} \text{ with probability } 1/2 \\ \end{cases}$$ $$f_1 = f_2 = 1$$ i.e. whether the next term is the sum or differ...

9:59 PM
@cairdcoinheringaahing On the subject of floating point precision:
Let's say you've got a floating point type with 10 digits of precision (using decimal floating point instead of binary, but the principle is the same). In that type, a number is stored as its 10 most significant digits plus an exponent.
Value = 0.123456: exponent = -1, significant digits = 1234560000. 5 decimal places of precision and then some.
Value = 12345.654321: exponent = +4, significant digits = 1234565432. Some of the original number is lost because it had 11 digits, but it's still correct to 5 decimal places (barely).
Value = 123456789876543.21: exponent = +14, significant digits = 1234567899. The original number had 17 digits, of which almost half were lost, including everything after the decimal point. No decimal places of precision. The number will probably be displayed as 123456789900000.0.
That's why I said requiring 5 decimal places to be correct could be problematic for large numbers.

Hmm, yeah that could be problematic

Double-precision floats are a good standard (that's Python's float type, for example). Wikipedia says that a double gives 15 decimal digits of precision guaranteed. So I think if you say that the first 15 significant digits have to match the test case, that should be fine.
A number smaller than 15 would be fine too.

@DLosc Ok, that sounds good, I'll edit that in

I notice that your scipy results are giving some values fewer than 15 significant digits (0.000000000012010 just has five), so there may be something else going on with how the floats are displayed.
Oh, unless you rounded those to 15 decimal places?

10:20 PM
@DLosc I've long since deleted the program I used, but IIRC I did round to 15 d.p.

Ok, yeah. Python outputs floats with very large or small absolute values in scientific notation by default: TIO

10:39 PM
@DLosc Thoughts on the update just made?

People probably noticed my account is renamed to “null” and the showcase meta question is too. I feel very sorry about this - a person controlled my account and did this (no, I’m not joking). For this reason, I’m also not going to be active for the next few days. Announce this to CGCC, please!
I will not be able to use Stack Exchange for the above reason, but I will be active on twtxt. And as a somewhat silly request, I wish someone to ask on Mother Meta, either logout my account from all device and reset the password (to protect it from being deleted) or remove the “remove login” feature or “delete account” feature specifically for my account. Thank you.

@Lyxal Only a mod would be able to log them out, I'd recommend raising a mod flag on one of null's posts and explaining this

0

U+007F, though it is not a C0 control character, Unicode still considers it as a control character. It is the deleted character. If one mis-punched a character into a punched tape, one would turn it to the deleted character by punching all 7 holes. An interpreter for punched tapes would skip all ...

10:56 PM
@cairdcoinheringaahing Yes, I like that language. I would just add that a couple of the test cases need to be redone, since they don't have 10 significant figures:
5, 40 -> 0.000000249389435
9, 53.59375 -> 0.000000000012010

@DLosc Good catch, should be fixed
Would anyone be especially opposed to a suggestion on meta that we remove a bunch of tags that refer to specific languages, but only have 1 or 2 questions?
For example,
We have a whole series of them, and I was thinking about opening a discussion on burninating them

@cairdcoinheringaahing I don't think that's a bad idea.

11:12 PM
@cairdcoinheringaahing Sounds good. But who can actually burninate those tags?

@Bubbler We can remove tags from questions, and they'll get auto-removed. Mods can burninate those which are too widespread to easily remove, and certain users can vote on duplicate/synonym tags
But I'd like to open a discussion before anyone goes off and starts untagging questions
> Side note: Remember, users with more than 1,250 reputation and a total answer score of 5 or more on a given tag can vote on tag synonyms for that tag, and a few synonyms are still pending.
I think the rep has changed by now, but otherwise, it still applies