« first day (2711 days earlier)      last day (2123 days later) » 

12:12 AM
actually upon further inspection i think it might be a dog
 
Can you not see the teeth?
 
although the mouth is from a cat
 
not entirely convinced theyre from the same photo, the fur around the mouth is brighter
I don't know
 
Do you not see the shadows from it's legs!
 
12:17 AM
I've seen cats that look like that.
 
That would be why the front of the cat is brighter!
 
BTW, our q/d ratio is only 3.7...
 
I'm not saying "ratio" doesn't technically work, but "rate" might be a better term.
And yes, rather low.
 
sorry, *our q/d rations are only 3.7
2
 
^ Da heck
 
12:21 AM
@FreezePhoenix No, see, two carets point two messages up. One caret points one message up.
 
The problem: we eventually ran out of questions that new people find "inviting".
At least that's what I think
 
Nah, I think there are still plenty of ideas out there. Interest just kinda faded.
 
That too
Hey, @FreezePhoenix: would it be okay for Brainfuck's output to be ****NIARB?
Anyone know of a Befunge-93 interpreter WITHOUT the restriction on size? ...
 
12:45 AM
what's the usual restriction?
 
Too small for polyglotting...
 
that's a useful answer
80x25
that should work
 
@Zacharý UH... yes that makes sense
 
you're opening a can of worms by allowing that IMO
 
@ConorO'Brien did you get my ping?
 
12:51 AM
which
about the curry?
I merged your PR
 
^^ yes
^^ Thanks!
30 mins ago, by Pavel
@FreezePhoenix No, see, two carets point two messages up. One caret points one message up.
 
@FreezePhoenix Don't allow that, actually. Let me try to unscrew the challenge (finding a good befunge-93 interpreter)
 
^ Why would that be so?
 
only 25 lines and 80 columns supported in Befunge-93
 
@Zacharý see this message:
5 mins ago, by Conor O'Brien
http://www.quirkster.com/iano/js/befunge.html
I'm pretty sure this doesn't have a finite codebox
 
12:55 AM
Doesn't work... it reflects on ;
 
@FreezePhoenix do you allow interpreters made after the challenge was posted
 
Sorry, I was not thinking right: I'm trying to get rid of a "What do you want 0/0 to be?"
 
1:08 AM
still in the output
 
oh
that wasn't teh question :P
 
:P
Major rewrite is probably in order then :/
 
Oh, does anyone know if it's possible to get webhooks for repos you don't own on GitHub? I'd like a http request whenever a specific one gets a push
 
@ConorO'Brien NO
 
@FreezePhoenix why the caps.
 
1:16 AM
because it's a definite answer in definite terms
 
even if the interpreter isn't designed for the challenge?
 
@ConorO'Brien Now how would we tell that :P
@ConorO'Brien Tell you what. I'll look at your interpreter
 
@FreezePhoenix that's a standard phrasing for PPCG IIRC
@FreezePhoenix and the question was purely hypothetical. I was planning on writing a befunge 93 interpreter without a codebox restriction if it came to it
 
I don't need you to do that.
 
> if it came to it
 
1:20 AM
@ConorO'Brien You'd have to prove that it wouldn't interpret for the question
 
Would having the user provide non-empty unused input be a standard loophole?
 
I believe it would be
 
i think it depends
CSS, for instance, often needs an initial "input" to begin running
there's a ruling about that specifically
 
@quartata the style markup?
 
yeah
 
1:24 AM
I dunno how you run that
 
I hate yes
I just crashed my computer piping it to befunge.
I'll try a major rewrite of the code tomorrow.
 
@Zacharý that means 'assume Y for all queries'
Not very smart
 
@FreezePhoenix The yes command...
Isn't that the one that just prints something forever?
 
Oh... I forgot :P yep thats what it does
I was thinking of the --yes flag
 
YES indeed.
 
1:35 AM
Stop making terrible puns
@ConorO'Brien Meaning you can't challenge people to a fight? :P
 
wait why did that get 7 stars I thought I'd be alone on that one lol
 
@FreezePhoenix never.
 
@ConorO'Brien And now you have an 8th :)
 
@Zacharý What about the FBBI interpreter?
 
It implements ; from Befunge-98.
 
1:40 AM
Oh. The MTFI one?
 
.code.tio:9: only 25 lines and 80 columns supported in Befunge-93
 
And I guess PyFunge is why you wanted to know about unused input...
 
Yeeeppp
 
Wow, there are 16 different versions of Befunge in the TIO interpreter. That seems excessive
 
@JoKing there are over 23 versions of Befunge
 
1:48 AM
does anyone know of a way I could make a SEDE across all sites?
 
@FreezePhoenix Which is also excessive
 
2:03 AM
@Zacharý Sorta relevant: If a language cannot suppress a user prompt, the solution may expect this prompt to return empty. from here
 
I have working code (not in Somme, that's easy to fix)... but it adds too many bytes, and prints "****NIARB"...
 
@Zacharý but the language name is brainfuck...
 
exactly my point...
case-insensitivity and censoring... I won't post it anyways
@DJMcMayhem, are you the BrainFlak Guy?
 
You could try using BF-crunch to generate the code
 
I heard the words Brain-Flak
 
2:10 AM
me2
 
I can do KC for brain-flak. Give me a word and I will make it.
 
@CatWizard Oh, it was you, never mind
 
@CatWizard Oh yeah, let's see if my meta-golfer can beat your solution :P
 
@CatWizard "kalf-niarb", or any variation in case
 
I will beat the machine
 
2:12 AM
@Zacharý One of them, not the primary one :P
 
@FreezePhoenix flashback to polyglot challenge
If worst comes to worst, we can revive the polyglot gods, but I don't expect that for a while (Chance and stasoid)
 
2:28 AM
@Zacharý 116 bytes
 
that ... won't work. I'll save it for later when the 30% gets bigger.
But that is amazing
 
Very nice. The shortest my meta-golfer gets is 124 bytes
 
~80 is where 30% stands
 
Oh yeah I forgot about case insensitivity
@JoKing JoKing, I've noticed your meta-golfer is very bad at forwarding.
That 124 byte could be forwarded a bit.
 
2:35 AM
Now, try without the -...
 
Oh boy.
 
I could probably just add another befunge in there,
 
Klein could be added easily.
 
@CatWizard Yeah, there's a few tricks that could make it more efficient. I'll put it on my list
 
I could write you a forwarder, I'd probably want to do it in Haskell though.
 
2:41 AM
dafuq is klein?
 
https://tio.run/##bVXrdtpGEP5tvUL/jIWPJWGkNSZNGnOpbSCpUwg@B@I6MQnRZYU2lrQ60sqG5vIIfYA@Xl/EnZWAEDucI7E7O/Pt3L6RY2fB/b1rC@iAyz2qCJ67ASQpi0WmKBVgPix5DrbngZ3O84iivAaRfUMhy1MKgkPEPeYvQTBuJUvIOIgA8URAl2hCgcVumHvUw4UUQsjiG4W6AQczBnWvruLVpa2iDE5fv3xz@rI/O3/d61@168rZ20l/3Fb39DsXTLclXTRUxc9jF01iCO14nttzqhuflZ0CU63A3o8oFuzVa7BXIIGzFDRTlZ3Rm8nFm4kEdjADCI2eHKkIvdO/uuh3J/2ePCsR0cUvKb2Vh5iNaxSU1irstnGzNlDhfVMGGCs7K1f6i4S6AiPf6NRgzgWs7aXiggmoKzs@U3YeBI/36w9COagb0osS3YTpxxXS9KNMbpHKzrp2X2X1AiGS7JiQORNB7lguj8gkXZ6LUYxVoESkSyb4ek0piexM0JTcpXaS0DRDhHWGQcXECRXU4vJirXw/w@BVL/LATPO46KPtwzGPIooKae4sgfBEkExKyreVOo8
 
Wrong link?
 
Nevermind, I forgot how Klein worked. Doesn't work in Klein
 
 
2 hours later…
4:16 AM
You forgot how your own language worked?
 
I remembered, but yes I breifly had a miscons=ception.
 
NameError: ception is undefined
 
Isn't it time to start a new Language of the Month?
 
@EriktheOutgolfer I think it should be Japt too, especially since it's leading by 1 vote now.
I also think I don't want to be the one who has to post the new LotM every time, so maybe a meta question to clarify a procedure is in order.
 
4:41 AM
@DLosc Whoever suggested the language sets it up?
 
@JoKing Yeah, my first idea was that it should be the person who wrote the suggestion, and if a day or so goes by without any activity, then anybody can do it.
 
5:24 AM
0
A: Sandbox for Proposed Challenges

Conor O'BrienQuine Relay! answer-chaining quine A quine relay of order \$n\$ is a series of programs \$P_1\dots P_n\$ in distinct languages such that each program \$P_i\$ outputs \$P_{i+1}\$ and \$P_n\$ outputs \$P_1\$. For example, a 2-quine relay can be seen here: Ruby → Perl 6: This Ruby program: $><<...

 
idea for a challenge: check if a player of gess can win that turn in a position given chessvariants.com/crossover.dir/gess.html
 
 
3 hours later…
8:10 AM
88
Q: Simulate the Universe!

vszOne nice property of a Turing-complete language is that it can be used to write any program, up to and including the simulation of the entire Universe. Your job is to do exactly that: write a program which simulates the Universe. Note: although I don't doubt you'll be able to accomplish this ...

 
 
1 hour later…
9:26 AM
CMC: Given a Boolean list, return whether it is all true AND length>0. E.g. [true,false]false. [true,true]true. [true]true. []false.
 
@DLosc I just pinged you because that's how it usually happens :p
also, Japt was already leading some time ago
18 hours ago, by Erik the Outgolfer
...and an upvote has been suddenly removed...
@Adám Jelly, 1 byte: Ȧ
 
@EriktheOutgolfer OK, sure, now do it in some other languages.
 
9:52 AM
@Adám it should be 2 bytes in Dyalog, no?
in Python it's not so trivial, but still easy :P
and should also be 1 byte in an 05AB1E/Jelly polyglot too (P)
 
@EriktheOutgolfer But different codepage...
 
the byte should be the same
 
@EriktheOutgolfer Huh, how?
 
@Adám ×⌿?
 
@EriktheOutgolfer 1=×⌿⍬
 
9:59 AM
@Adám hm
 
@EriktheOutgolfer and so too for ∧/ ;-)
 
@Adám and... ⌊⌿⍬ also fails
 
@EriktheOutgolfer Yeah, that gives ∞ (more or less).
 
@Adám Brachylog, 4 bytes: dȮh1
nevermind it's wrong
lul
 
@EriktheOutgolfer Best I've done so far is ∧/⊢,⊃.
 
10:03 AM
or d[1]
 
@Fatalize What does that mean?
 
@Adám and not ≢⌊∧⌿? :P
 
@EriktheOutgolfer Ooh, clever.
 
@Adám or even ≢⌊⌊⌿, as ⌊⌿⍬ does what ⌈⌿⍬ should do imho and vice versa
(I guess it depends on how you think about it)
 
@EriktheOutgolfer Why do you think ⌊⌿⍬ and ⌈⌿⍬ are swapped?
@EriktheOutgolfer Btw, and and × runs the same code when arguments are Boolean.
 
10:08 AM
@Adám well, while ⌊⌿⍬ makes sense in that there's no element in there to "restrict" the minimum, so the maximum possible value is there instead, on the other side, it's immediately apparent that ⌊⌿⍬ asks for a "minimum" after all
@Adám yeah, so it can also be ≢∧∧⌿
 
@EriktheOutgolfer But -∞ isn't in .
@EriktheOutgolfer No, that'll give 2 on 1 1.
 
@Adám ah yeah
(duh I'm not used to it being LCM so much)
 
@EriktheOutgolfer Yeah, that pairing was wrong, imho.
 
@Adám d[1] -> the input with all duplicates removed is the list [1]
 
@Adám well, we have 3 different logical AND functions anyway, but I agree that there should have been one which errors on non-boolean arguments
that is, otherwise people try to debug and a "why the HECK does a BOOLEAN function return STUFF?" is heard every now and then :P
 
10:24 AM
@EriktheOutgolfer If they had asked me, I would have extended with:
∧←×
∨←1-(1-⊣)×(1-⊢)
⍲←1-∧
⍱←(1-⊣)×(1-⊢)
~←-+¯1*>⍨
 
@Adám wouldn't ∧ and × be the same though
 
@EriktheOutgolfer Yes. That could have saved a glyph.
 
@Adám yeah, but what else could ∧ represent
 
@EriktheOutgolfer Dunno. Is it really so bad that two primitives do the same sometimes?
 
@Adám nah, never complained about that
although if they always do the same then I think it might be a problem
 
10:33 AM
@EriktheOutgolfer We could have then (and still could…) define ∧Y as ≢⌊∧/
 
@Adám like, "any and all"? why not just ∧/?
 
@EriktheOutgolfer Because that should give the identity element of .
@EriktheOutgolfer And then, by extension and logic, ⍲Y could be ~∧Y.
But what should ∨Y and ⍱Y be?
 
@Adám hm, I wonder what would be appropriate for basically all primitives which can only be dyadic as well as the one(s? ...) that can only be monadic...avoiding glyph proliferation, right?
 
@EriktheOutgolfer There are not so many, only the Booleans, the relational, and f⌺. Btw, f\ f⍀ f.g ∘.g are also strictly monadic.
 
10:44 AM
@FreezePhoenix Hey, the "official" one has even lower score.
 
@Adám uh, by f⌺ you mean f⌺N, no? also, f.g and ∘.g look pretty dyadic to me
 
@EriktheOutgolfer Yeah, that was one messed up summary.
 
@Adám How many ads have you posted or edited... I'm at 3 for you and counting :P
Well thats broken:
 
@FreezePhoenix What caused the change in opinion? From +10 last year to -6.
 
Probably because the app got made at some point
 
10:47 AM
did it
 
@EriktheOutgolfer Strictly monadic: f\ f⍀ f⌺Y (well, and niladic). Strictly dyadic: , relational, Boolean.
 
@Adám f⌺Y is in both lists
:P
 
@FreezePhoenix 5
 
@Adám O_O
 
@Adám JavaScript, 20 bytes: a=>!!eval(a.join`&`)
 
10:50 AM
@Adám Hmm, how do I install that browser bar
 
@FreezePhoenix Which language do you want?
 
Javascript
hehehe not that I need it. I do most of my programming in a text editor without syntax highlighting, so...
 
@FreezePhoenix I mean, you want a language bar for a specific language. Which language is that?
 
:45435242 When restating an opinion that bye the looks of it may have changed, yes.
@Adám ECMAScript8
 
@EriktheOutgolfer ⊥Y and ⊤Y should be 2∘⊥ and 2∘⊥⍣¯1, imho.
@FreezePhoenix Uh, does your keyboard not have all the characters that JS uses?
 
10:55 AM
@Adám Oh so that's what thats for :P i thought you would just type in a unicode point. Yes, it has all of them.
 
@EriktheOutgolfer X f⌺ Y could conveniently let each element of X correspond to a dimension, indicating 0:abyss 1:join ¯1:twist-join.
 
@Adám not ⊢⊥⍨1+1⌈⌈/ for ⊥Y?
 
@EriktheOutgolfer Nah, seems a bit too specific. Never needed that except when golfing. And what would ⊤Y be then?
 
@EriktheOutgolfer Dyadic f\ (and maybe f⍀ too) should be ∘.f and monadic f.g should be generalised determinant.
 
10:59 AM
what...escape hell it seems
@Adám and the determinant would be -.+?
or +.×?
I think determinant needs 3 functions
 
@EriktheOutgolfer -.×. +.× is the permanent.
 
@Adám oh, the + would be implicit then
 
11:17 AM
@EriktheOutgolfer What +? See NARS and Iverson.
 
@Adám for a 3×3 matrix M, det(M) = det(M ₁₁ M ₂₁; M ₁₂ M ₂₂) × M ₃₃ - det(M ₁₁ M ₃₁; M ₁₂ M ₃₂) × M ₂₃ + det(M ₂₁ M ₃₁; M ₂₂ M ₃₂) × M ₁₃
that + over there is what I'm talking about
 
@EriktheOutgolfer Ah, but that's really an alternating sum, which in APL is just -/
 
@Adám hm, so it would resemble dyadic .
 
@EriktheOutgolfer Makes sense, no?
 
@Adám well, yeah
 
11:27 AM
@EriktheOutgolfer det M is (((M₁₁×(M₂₂×M₃₃))-(M₁₁×(M₃₂×M₂₃)))-(((M₃₁×(M₁₂×M₂₃))-(M₃₁×(M₂₂×M₁₃)))-((M₂₁×(M₃‌​₂×M₁₃))-(M₂₁×(M₁₂×M₃₃)))))
@EriktheOutgolfer Easier to read: (M₁₁M₂₂M₃₃-M₁₁M₃₂M₂₃)-(M₃₁M₁₂M₂₃-M₃₁M₂₂M₁₃)-(M₂₁M₃₂M₁₃-M₂₁M₁₂M₃₃) using implicit multiplication before everything, but APL's right-associative -.
Ugh, NARS has )LAOD and )SVAE. ⍨
 
uh, ⌽⊖ have Identity element 0...?
 
@EriktheOutgolfer Yes, of course, because 0⌽Y and 0⊖Y are no-ops.
 
@Adám and I like how <≤=>≥ also have identity elements
I presume they're boolean values
and, well, =/⍬ must be true, so ≤/⍬ and ≥/⍬ must also be
ok Table 19 really makes you think
 
11:42 AM
@EriktheOutgolfer What do you mean by must be true?
 
@Adám like, aren't all elements of an empty array equal?
 
@EriktheOutgolfer Sure, but that's not what =/ checks.
 
@Adám yeah, it checks if it's in the form of 1 1 1 1...X X
 
@EriktheOutgolfer What?
 
@Adám e.g. =/1 1 1 2 2 should be 1
likewise for =/5 5⍴1 1 1 2 2
 
11:45 AM
@EriktheOutgolfer Ok, but 1 = =/0 1 2
 
@Adám hm, you can say that too
some stuff is best to not be reduced :P
 
@EriktheOutgolfer Rather, X ≡ 1=X and X ≡ 0≠X and X ≡ 1≥X and X ≡ 0≤X and X ≡ 0>X and X ≡ 0<X (for Boolean X).
Those 0s and 1s are the (left-)identity elements.
 
 
2 hours later…
1:34 PM
-1
Q: Xfactor code function

GiladWe have a library supplies the function: BOOL HasXFactor(unsigned int n); HasXfactor returns TRUE if n has the XFactor mathematical property, FALSE if not - we do not know what the XFACTOR mathematical property is, nor do we care. we have the task of finding how many numbers from 0 to MAX_UIN...

 
 
2 hours later…
3:08 PM
SUSE Linux Sold for $2.5B - news.ycombinator.com/item?id=17441171
 
3:21 PM
.___.
 
how many active users does ppcg have on any given day
 
@NewMainPosts Missing tag, although the description includes info for how code is measured.
Although I think I will downvote it anyway. It's trivial, just let each processor handle 1/k of the values.
 
3:37 PM
uh, is that really the problem
> we do not know what the XFACTOR mathematical property is, nor do we care.
 
3:57 PM
0
Q: trying to get the (new) topbar fixed

TitusSince we got our own design, I try to reestablish that my topbar is fixed; but I can´t seem to get it right; and I can´t think of anything else than @-moz-document domain(stackexchange.com) { .top-bar { position:fixed } } in userContent.css, but that has no effect. Any idea how I can keep...

 
@EriktheOutgolfer What's wrong with having a blackbox function?
Maybe I'm missing something.
 
4:22 PM
@AdmBorkBork I don't think that's a black box function...
> Since we got our own design
:/
 
It's pretty much literally a black box function. You give it a number and it outputs true or false. The difference here is you know a little bit about the timing of it, because you know it's linear based on the size of the input.
 
but it's not given to you, is it?
 
That's the first line of the challenge
A library that defines a function
 
looks more like OP has a hidden function on their PC than it being given as a black box function
 
Now you're just arguing semantics. What's important is that there's some function, and it outputs true/false, and we only know what the timing is.
It's a real shame that the question was downvoted and deleted. It seems pretty interesting.
 
4:33 PM
It's certainly not possible to do it any faster than to check all the instances
 
That much is true. But given k processors, you can certainly do it faster than given 1 processor.
 
Yeah, you just perform the operations concurrently.
I think it was a super uninteresting question.
 
It's basically a packing problem.
 
also, is K given or not?
the solution is essentially just n % K
 
hmm. I wonder if there's a more efficient algorithm. It feels like that should be beatable.
 
4:41 PM
might've been more interesting if processor speeds were given instead
 
Meaning that the k processors aren't all equivalent?
 
more like threads
we're not talking supercomputers :P
and maybe the concept being more generalized
like, we want ops 0..n to complete in order from 0 to n, and we want to assign each one to a thread
 
5:02 PM
Wait, you want each op to happen in series, but across multiple threads?
 
5:27 PM
Holy shit there's a new @stasoid answer
We're on 212 languages
 
I just asked an algorithms questions on math.se if anyone is interested math.stackexchange.com/questions/2838751/…
 
5:57 PM
How does one vote on a tag synonym?
 
https://codegolf.stackexchange.com/tags/<tag>/synonyms?
 

« first day (2711 days earlier)      last day (2123 days later) »