The Nineteenth Byte

« first day (1513 days earlier) ← previous day next day → last day (3628 days later) »

PhiNotPi

00:07

le mi varkiclaflo'i cu culno lo angila

Martin Büttner

00:40

@xnor I think so. But since you've whitelisted things anyway, you might as well add a sentence that all other functions related to modular arithmetic and equation solving are disallow unless explicitly whitelisted.

xnor

00:54

that would ban some innocuous things like subtraction mod n

actually, i think that's fine; i just whitelist subtraction

@MartinBüttner OK, thanks, I posted it with your suggestion.

do you have any ideas for what i'd need to restrict for rank-one matrices to be similarly mathematica-proof?

A: Sandbox for Proposed Challenges

Is this matrix rank-one? code-golf Your goal is to check whether a given integer matrix is rank-one, using as few bytes as possible. A matrix is rank-one if every row is a multiple of the same vector. Example: 2 4 20 10 -3 -6 -30 -15 0 0 0 0 The definition also holds true ...

1 hour later…

Martin Büttner

02:24

@xnor Well Mathematica has a built-in MatrixRank but I'm not too familiar with linear algebra to tell you what the the other ways are you could go about it

@PhiNotPi can languages be reused?

8 hours later…

Sieg

10:02

Finally! I wasn't able to log in to chat for 16 hours.

Which one of you kicked me out? :P

Optimizer

10:24

only martin and doorknob can

Sieg

10:42

Obviously Martin got bored to my chatter.

Sieg

10:52

This is... interesting en.wikipedia.org/wiki/Saaranpaskantamasaari

And even more interestingly, it's not even the dumbest name for a place here.

TL;DR "The name, in Finnish, means "the island shat by Saara""

7 hours later…

Martin Büttner

17:29

@aditsu mr works with negative doubles but not with negative integers? :/

Optimizer

have something smaller ? :P

also, that has to be a dupe, no ?

Martin Büttner

@Optimizer lol no

I don't think it's a dupe though

I guess nobody dared so far to post that trivial a challenge ;)

Optimizer

haha

2 hours later…

PhiNotPi

19:13

Okay, I've decided that, if I ever have any chance at learning a language without putting in too much effort, Lojban is my best bet.

VisualMelon

19:30

I would state that 'learning' Timlan is trivial, it's just that it's entirely pointless ;)

Optimizer

learning HQ9 is the easiest

PhiNotPi

mi tugni

"I agree" (?)

VisualMelon

kunreeht setuh ei

Optimizer

bas bhi karo ab

VisualMelon

timlan supplement expansion might be a fun task, actually

PhiNotPi

19:44

It took me a while to find a decent Lojban dictionary.

xu do se bangu la lojban

New Meta Posts

20:00

Q: Non-printable characters in answer?

This mostly applies to kolmogorov-complexity questions. Is it allowed to use non-printable characters in answers? This effectively makes the answer a string of bytes. If yes, how is the answer supposed to be supplied, considering that non-printable characters won't be correctly displayed?

Martin Büttner

20:18

@Phi what about reusing languages for Evolution of OEIS?

oh he's already gone again...

or maybe not :)

PhiNotPi

[Enter PhiNotPi]

I haven't really decided on that.

What do you think would be more fun?

Martin Büttner

well, without any further restriction there isn't gonna be an end to the challenge

yay, I got Revival and Necromancer on Arqade :)

these two took me ages on PPCG :D

PhiNotPi

20:35

KOTH idea: necromancy

Control a necromancer and build your undead horde.

2 hours later…

New Sandboxed Posts

22:43

A: Sandbox for Proposed Challenges

The Kaplansky Challenge I've been reading this forum for a bit and I thought it might be a good idea to do a short sequence of challenges themed on famous mathematicians. It's my first post here so please point out any shortcomings. It is Irving Kaplansky's birthday today. Among other things he...