« first day (2687 days earlier)      last day (2147 days later) » 
00:00 - 15:0015:00 - 00:00

12:00 AM
@H.PWiz oh yeah. also think i found a 37 byter in Haskell (basically identical to your solution though)
 
Nice, 9 is shorter than 21
 
12:56 AM
:| i've left my laptop running orlp's hyper-optimized solution to this for n=102 and n=106 (maybe i should have tried n=100 first?). it appears to be up to ~4 trillion but it hasn't stopped yet :/
ok. time to try to identify patterns for a >2-year-old challenge
         1                                                  1
        10                                                 10
        11                                                  1
       100                                                110
       101                                                100
       110                                               1110
       111                                                  1
      1000                                               1110
      1001                                               1100
we can see that #trailing 0s (of right column) is #trailing 1s + 1
except when the left is of the form 2^n-1
 
@ASCII-only What patterns do you think there are?
 
I... I don't know actually
nobody's solved the mystery of 36 and 94 yet either
 
Binary repr can be useful of course ...
 
which is what i'm using?
 
Looks like most of them are eiither 11..1 00..0 (difference between two powers of 2) or 101010...10 (2 floor(2^x/3))
73 too?
 
1:27 AM
*all of them, yeah. but how can we predict difference between which two powers of two exactly (given the number)
@user202729 yeah. but it's established that f(2n+1) = 2f(n)
...oh. that's why "#trailing 0s (of right column) is #trailing 1s + 1"
 
@ASCII-only Why is it "leading 0s"? should it be "trailing 0s"?
 
@user202729 crap. yes >_>
 
1:48 AM
This made me laugh very hard so I thought I would share it with you guys.
11
 
> Unfortunately, Haskell has no currying
wait what
 
wait I thought the only way Haskell did multi-argument functions was with currying >_> I am apparently bad
 
The whole article is a meme
 
oh
so Haskell does have currying?
 
2:00 AM
Yes, but not in the way that the author is programming.
 
> Such beautiful eyes. You remember when your own still held color.
 
The author is programming at the type level, so as they say "Haskell is a dynamically-typed, interpreted language."
 
@ASCII-only o_O
So basically I shouldn't actually take anything in that article seriously if I want to understand Haskell.
 
Yeah. The article is probably intended for if you already know haskell. The code all works, but it is not good code.
 
clearly this should work in Cream Puff
 
2:08 AM
Cream Puff?
 
2:28 AM
hey @ASCII-only i made a thing for you
 
@DestructibleLemon ?????????/
 
:|||||||||||||||\
i can barely read that
 
yeah
ambigrams are hard dude
i made that a little bit of a while ago.... i wonder if i've gotten better since then
 
1
Q: I forgot towel day

Francisco HahnI forgot towel day Sandbox link As you may know, may 25 is well known as Towel Day, because of the many uses a towel can have. A simple extract if the book "The Hitchhiker's Guide to the Galaxy" (personally i took this book as an "everyday guide") states: "A towel is about the most massiv...

 
:|||||||||||||||\
 
the c/n got worse
 
3:11 AM
II and o can't fit.
 
3:49 AM
wut
 
4:04 AM
CMC: given an array of integers, return an array where i occurs a[i] times. E.g. [1,0,3,0] -> [0,2,2,2], sort of a run-length decoding.
 
ngn
@FrownyFrog k: &
 
I'm curious about Jelly :)
 
@ngn what is this black magic from a language with only 20 builtins
 
ngn
@ASCII-only it's a very important primitive called "where", it converts a boolean mask to a list of indices
the behaviour FrownyFrog described is the natural extention of that
 
APL has underlined i, which actually can't do it
you just assume it should :D
 
ngn
4:08 AM
@FrownyFrog that was introduced recently by Dyalog
they didn't go all the way
does j have something similar?
 
ngn
@FrownyFrog interesting, for the multidimensional case it processes each row separately and then pads with 0s
Dyalog returns nested index vectors
 
it's rank 1
so it just sees one row at a time
Same for i:
no, that's 0
I remembered I've seen something similar
argh
 
ngn
we badly need doc tips on hover in tio...
@FrownyFrog what is b. there? b.0 doesn't work on its own
 
b.0 gives rank, b._1 gives definition of the inverse
must be a conjunction
so it doesn't work on its own
 
ngn
4:22 AM
ah, I see
 
this is how J computes a reverse factorial for example
b. is not a conjunction, it just needs something on the left
 
Somehow my challenges have strictly decreasing score.
 
5:00 AM
@user202729 wait what
@FrownyFrog Jelly, 3 bytes: LḶx
I think?
 
seems correct
there's no LḶ built-in?
not necessarily 0-indexed
 
doesn't look like it
 
thanks
 
5:27 AM
@ngn how did you get your language on repl.it ?
not tio.run
ngn/apl is also on repl.it
 
@gnu-nobody wait. what
@gnu-nobody are you sure that's not normal K and normal APL
 
its quite ngn/apl
 
@gnu-nobody what makes you sure...
 
I mean, why not?
ngn-apl is relatively well known and probably the easiest modern apl to use
GNU APL is horrible and Dyalog has a tricky license
 
@Pavel wait. what :O
 
5:29 AM
oh
wait
 
@gnu-nobody :O
 
can u see that
i cant
 
I see ngn/APL
 
imgur is banned
 
ngn
@gnu-nobody I sent them a pull request
 
5:30 AM
aww
 
wow thats nice
 
:| repl.it has a disappointingly small number of languages
 
yes
but i use it for the runtime input
 
@ASCII-only score = vote tally.
 
@ASCII-only Compared to TIO, yes, but compared to other similar services, not really.
 
5:34 AM
@user202729 yeah but how. do you only have 2 challenges or something
 
3.
For 1 challenge it's obviously true.
 
@Pavel but it also has the most useless languages: emoticon, lolcode, BrainF
@user202729 ok then that's a lot less surprising
 
Because they don't have talk.repl.it.
And nobody ask them to pull things.
I suppose.
 
lolcode and brainF are the most well knowns esolangs
 
also why do they call it "BrainF"
@gnu-nobody not too sure about LOLCODE
 
5:37 AM
@ASCII-only what? lolcode is quite well known
 
@gnu-nobody but i wouldn't say it's the first or second most well known
 
@ASCII-only Why not?
 
btw, my question got 700 views in 12 hours :)
 
@gnu-nobody I don't know it.
 
@user202729 lolcode?
lolcode is pseudocode in lolcat language
 
5:39 AM
And my question get 93 views.
 
@user202729 there's too many esolangs that sooner or later that's going to be the name for a different language
@gnu-nobody ... it's actual code in lolcat language
like trumpscript just almost as bad
 
Probably I should make a code golf variant.
 
what
 
of what
 
my recent challenge...
 
5:53 AM
@HatWizard don't miss out on the Hexing, the previous one
 
6:06 AM
in talk.tryitonline.net, 4 hours ago, by Dennis
https://tio.run/#nial
 
@FrownyFrog and the one before that
 
the first one is mostly code, I can't appreciate it
 
@FrownyFrog :||||||||||\\
 
7:01 AM
@Adám can't figure out output
writefile 1 (string 7)
but doesn't work with lists
 
@FrownyFrog this maybe?
 
even without parentheses
 
@Adám Neat :)
 
:|
just accidentally refreshed TIO. there goes a few hours minutes of work
 
@ASCII-only ... that's unfortunate ...
Try going back in history?
 
tried that
 
7:31 AM
Tips: Occasionally goto the share menu.
 
share menu?
 
the linky thing
clicking it saves the state
into URL
so refreshing goes to that
 
well i only have code field filled so ctrl + a, ctrl + c is a lot faster
 
What about [esc] [s] [s]?
 
yeah. the thing is it's so long <kbd>esc</kbd> takes a while to load
:| kbd doesn't work in chat
 
7:36 AM
they've crudely translated the Hexing into Russian
with the man-on-man part censored
 
@ASCII-only None of the html tags work in chat...
And markdown is (a bit) different.
like this.
 
-how-
 
Chat support md strikethough. Main doesn't (and you have to use html strikethough)
 
~how~
 
@FrownyFrog Use /messages/<room id>/<message id> to view message source...
 
7:42 AM
@user202729 oh yeah. weird
 
unbelievable
 
8:34 AM
guys
how can a for-in loop be implemented in an esolang
which is stack-based
 
In what?
Does the esolang have object type?
 
no
only numbers and chars and lists
also strings
 
Well...
Just implement it?
 
iterating through all members of a list or string
oh wait
ok
i will add list and string subscription
then no need for for-in
 
@gnu-nobody what's so hard about it
in wherever you put your builtins: {"for-in": lambda l, f: [f(i) for i in l]}
 
8:41 AM
1
Q: Divide two strings

LyricLyOne day, I saw the challenge to multiply two strings and I thought I might be able to do one better. That challenge was fake. It was elementwise maximum. It was not real multiplication. So I set out to make something real. Real division between two strings. I quickly realized that this would m...

 
9:14 AM
@HyperNeutrino Physica and Proton have the same score while using the same approach (at least with my limited golfing skills) \o/
 
If there are 159 questions, and only 1 is unanswered, how does that make 1.9% unanswered?
 
:::::::OOOOOOOOOOOOOO
https://tio.run/##7T3tcts4kr/tp0CUHevDkj@S7M6sZDtlx3LGVY6ctZydmY0zKlqibF4kUkdSsb1Z/7ln2J/3dPsgN9fdAAiABCnJsSa5uq1UxRSIbjTQje5GA2j2J5PGVb//229PPb8/mg5ctuMFURy6znhvVS8bO7430YvGjvEzip3@R73gMgA8myP31us7o17fieKN68kkW2MaeyMvvtuERj3/qhe6Q3s9Z3QVhF58PRY1NwGl2@sH/id7fdmNaBPq9N1JHM2qx//2LqfDoRvKysOBO2Q/HXcOT3/qarA/ef4guAGUUMf1B95w9enUx6qddycnq0/hyfNd9u5t5bbKonjQbHKiK9RmsxkHvelk4oZA/@RuR6uwV9Fr31ar1dXVzU12fnp42mSXTuT1GXQHBtuP2TAYDaAWq0RBGN7VmR/EjB6rCmQQsGMG3RqN7pjvugMWB2waufB885IBjQMWTGPm@Sy@xsLbmLkTLwqgi8GQDULnKvCh2dFIYRx6t1B/4PXdqM7caLKB0O7tJFRVojs/dm6ZG4ZBKN6ql@3OIdsZBsEem15dr
it's only because it goes to "no answers" by default now
 
@ASCII-only So if nobody has upvoted answers (bad voting culture…) it counts as unanswered?
 
@Adám (and there's no accepted answers, IIRC) yep
 
@ASCII-only The page title says Highly Voted Unanswered Questions. One Q has score 1, one has 0, one has -1. Interesting definition of highly voted
 
9:26 AM
@Adám There are just too many questions. Not every OP know how to use SO.
@Adám s/Highly/Highest/
 
@Adám it's just sorted by votes (yeah, it's a bad name)
 
@user202729 Well, we should mother meta that.
 
It's correct for popular tags. For non-popular tags (almost) nobody cares about them.
+1 because every Stack Exchange site needs a "Why am I not dead?" question. — Adam Haun 18 hours ago
 
 
1 hour later…
10:38 AM
in Mathematics, 1 hour ago, by user548331
also how where do we direct suggestions like the badge award system literally being so satirical it's insulting
can someone be offended by the badge award system? you'd be surprised
 
@LeakyNun Long ago I read a netiquette saying: Don't say anything which can be offensive to somebody, e.g. "Nice weather today!" "— What the @$*& do you have against Seattle?!?!?"
 
lol
 
11:39 AM
@H.PWiz does the haskell do +/!⍳5×n?
 
More like +/×\⍳5×n
 
12:05 PM
@Mr.Xcoder aaaaand rip proton
I'm not sure when I'll actually get around to finishing Proton 2 because the parser is the easy part, I still can't decide what's a good way to make the type system.
 
what is wrongful about that?
 
@LeakyNun Tumbleweed, Disciplined and Peer Pressure aren't exactly the best badges out there...
@HyperNeutrino spam shouldn't be deleted like that
instead, it should be flagged, and the Community user will delete it in a special way
 
@EriktheOutgolfer it does say This answer was marked as spam
 
Right. Doesn't moderator deleting it automatically validate the flags though? (I think if Dennis spam-flags it it will automatically delete it as spam but still say Dennis did it with modpower)
 
12:19 PM
no idea how that & Dennis's deletion go together though
 
that's because it received a few flags, but not enough to get it deleted like that
and no, it doesn't say Dennis did it if done the right way
it says Community deleted it as spam or offensive
(which is different from the automatic hiding of the post's content)
 
@EriktheOutgolfer why is it worse if a mod deletes it as spam? Is SE really that stupid?
 
that wasn't deletion as spam, but normal deletion
and no, I don't think a mod can delete it as spam, only flag it as spam (which would be binding anyway, but the mod's name is hidden in this case)
 
@EriktheOutgolfer how is this scenario any worse than the community flag-deleting it? The message is there & I don't see anything else that should differ from a regular deletion
 
it's like 3 users voting to delete the post, not flagging it instead
even though there must have been ≥3 flags already, that's not the correct deletion...
 
12:24 PM
@EriktheOutgolfer but what's the difference?!?
 
first of all, the post gets locked by Community
then, it doesn't just say "deleted by" but "deleted as spam or offensive by"
 
@dzaima The difference is that getting flagged as spam and deleted counts differently against the account and so the account can get classified as a spammer and removed/banned/etc.
 
I think he meant what's the visual difference
and no, the only thing that happens when a spam post is deleted is 1) feeding the account to the black list 2) -100 rep of that account
but we often just destroy those accounts
 
@EriktheOutgolfer I meant all differences, but yeah, now I see why that deletion could be considered bad. SE ¯\_(ツ)_/¯
 
the issue at hand is that we can't red-flag deleted posts
and I don't think even mods can
and also the fact that, well, I don't think the correct button becomes visible to mods after 3 spam flags, so mistakes can happen
 
1:25 PM
@EriktheOutgolfer The spam flags says Exists only to promote a product or service, does not disclose the author's affiliation. How does that apply here?
 
the revision history does look ever-so-slightly spammy imo
 
There's only one revision.
 
I meant the page called the revision history :P
 
So Post Deleted by Dennis♦ makes it look spammy?
 
no, but, from what I've bothered to have a sneak peek at, it has a few capitalized stuff that might be names being advertised too badly, no? why would I consider a well-reputed mod's actions spammy o_o
 
1:33 PM
I'm just trying to understand what you're saying, because the revision history looks exactly like the actual post.
 
Only to mods
 
does it? the main post looks like this to me
> This answer was marked as spam or rude or abusive and is therefore not shown - you can see the revision history for details.
 
But it wasn't deleted as spam...
 
most probably there were ≥3 spam flags but <6
 
Try 1.
 
1:35 PM
try what?
 
There was one spam flag.
 
oh alright
 
(like i said mods' self-validating flags)
 
It wasn't mine.
 
that's not the case here...
 
1:37 PM
I never would have guessed that it looked spam-deleted to you. (Mods see the actual post, not the stub.)
 
(btw when I saw "Try 1." I thought you meant "try abusing 1 spam flag on a random post to see its behavior" and I thought "WHAT?", my mind is provably a mess)
> Mods see the actual post, not the stub.
I'm so sorry you mods have to endure that (maybe a measure taken so as to detect wrongly-red-deleted posts?)
 
That's what I always assumed.
 
ok so 1 red flag can do this to a post which should be just normally deleted...that doesn't come off all that well to me
on the contrary, I just wish we were able to vote whether or not to hide a deleted post's content, like a "hide contents" button, that, when used by enough users, makes the post hidden by default)
 
It seems to be just the stub thing. The IP isn't blocked. I wonder if the rep penalty would have been applied.
 
A hereditarily finite set is a finite set whose elements are all hereditarily finite sets.
 
1:43 PM
@LeakyNun wat
 
wat
 
e.g. the empty set?
 
right
 
Or the set containing only the empty set. Or the set containing on the empty set and the set containing only the empty set.
 
so N is a subset of HFS
 
1:45 PM
or {{{}, {}}, {}}
 
that's just {{{}},{}}
 
yes it is >_> oops
 
2
Q: Decoding the Kaadi system

sundarYou have come across an old Indian manuscript, one that describes mounds of buried treasure. The manuscript also tells you the location of the treasure, except that some crucial numbers have been encoded indirectly into the text. You figure out that the text uses a 'Kaadi' system, a restricted su...

 
ngn
@LeakyNun sounds like the royal family of sets
 
lol
 
1:46 PM
but {{{{}}, {}}, {}} should work?
 
sure
oh and HFS is a model of ZFC sans infinity
 
ngn
@LeakyNun and your challenge is... ?
 
I don't have a challenge
 
ngn
@LeakyNun I guess if you remove the "F" from HFS, it could be ZFC including infinity?
 
1:52 PM
I think that's V, the von Neumman universe
> the class of hereditary well-founded sets
 
CMC: create a bijection between the natural numbers and the hereditary finite sets
 
@H.PWiz i swear there was something almost identical
except with (essentially) hereditary finite lists instead
 
encoding numbers based on prime factors, yeah
 
there was one with prime numbers
 
@H.PWiz including 0?
 
1:58 PM
Not were I come from
 
someone just told me a nice bijection
but maybe not everyone here wants me to spoil it
 
ngn
does "hereditary finite" imply no ur-elements?
 
yes
because you can't prove that your urelement is hereditarily finite
1 min ago, by Leaky Nun
someone just told me a nice bijection
and union and powerset are easy to compute
 
ngn
@LeakyNun "unprovable" is not the same as "false"
 
@ngn that's because I left out some details in my definition
that's an inductive definition
 
ngn
2:01 PM
ok, I believe that
 
the implicit clause is that "that collection is the smallest collection satisfying that condition"
and "smallest" is well-defined by Knaster-Tarski, taking a sufficiently large ambient set
V_ω should be sufficiently large
I believe that HFS is a subset of V_ω
no, I think HFS is exactly V_ω
 
CMC: Using Maybe as peano numerals create a Addition typeclass.
 
lol
 
ok. so probably: 1 ≡ {}, 2 ≡ {{}}, 3 ≡ {{}, {{}}}, 4 ≡ {{{}}, {{{}}}}, 5 ≡ {{}, {{}}, {{{}}}} possibly
 
ngn
@LeakyNun uh, ok, that's beyond my set-theoretic intellectual horizons :)
 
2:02 PM
@HatWizard fun fact: i was just (kinda) mentioning haskell's typing in another chat
 
( of course)
 
@HatWizard so basically steal and modify the relevant code from your starred link? :P
 
Yeah, but golf it ;)
 
> Get duplicates from an array [duplicate]
 
i'm bad at haskell so i got stuck in a type system cycle immediately >_>
 
ngn
2:07 PM
@H.PWiz do you have your own solution? (if yes, don't tell me what it is)
 
@HatWizard also: using Maybe? so Maybe is the only data we can use?
 
@ngn No
 
@ASCII-only Uh no, you can also use () or some other atomic type
 
@ASCII-only maybe
 
@LeakyNun :|
 
2:08 PM
:P
 
:|
spoilers :|
 
2:25 PM
AmontilladOS - an operating system brought to you by Edgar Allan Poe.
 
@ngn I have one now, not original though
 
yesterday, by Neil
oh, the irony, when a question about duplication turns out to be a duplicate
 
@HatWizard :/ i can't even figure out how to do intersection types
 
should I spoil the nice bijection?
 
what is the bijeciton about?
 
2:33 PM
@ASCII-only What is your issue?
 
i have no idea how to do intersection types. at all
 
ngn
@H.PWiz My plan was to build a formula describing the construction of every set using the axioms, and the enumerate the formulas somehow, but I gave up. What's your solution?
 
39 mins ago, by H.PWiz
CMC: create a bijection between the natural numbers and the hereditary finite sets
 
@Cowsquack so the set of hereditarily finite sets is the smallest set satisfying the property that every finite set of hereditarily finite sets is itself a hereditarily finite set
 
@ASCII-only You know what intersection types are?
 
2:35 PM
and then there's a nice 1-1 correspondence between the set of hereditarily finite sets and the natural numbers
and I'm saying "1-1 correspondence" instead of "bijection" because the inverse is also easy to construct
 
@LeakyNun so {{},{},{}} is one?
 
that's just {{}}
but yes it is
 
@LeakyNun doh
 
@HatWizard >_> no. there's a 99.9% chance i don't know what i'm talking about and it's useless here
 
so {{{}},{}} is also one?
 
2:38 PM
yes.
 
An intersection type a ^ b is a thing of type a or of type b.
 
@ngn I had {×⍵:∇¨⍸⌽2⊥⍣¯1⊢⍵⋄⍬}, but it include 0 as an input. Take from wikipedia
 
ngn
@H.PWiz clever encoding
 
Acutally that is is a union type, an intersection type a ^ b is a thing of type a and b.
 
ngn
2:47 PM
@H.PWiz if you don't consider 0 to be a natura number, you can always +1 in one direction and -1 in the other, and it's still a bijection
 
Jun 27 '17 at 14:36, by Dennis
@NewMetaPosts Me in set theory: of course 0 is a natural number. Me in analysis: of course 0 isn't a natural number.
3
 
So a friend posed this challenge to me: given two strings, swap their vowels. For instance: f("hello", "world") returns ["hollo", "werld"] and f("xaeiou", "eeeeeee") returns ["xeeeee", "aeiouae"]. Now I'm sure I could do better in an actual golfing language but he only knows Javascript. I'm trying to golf down my JS solution from 138 bytes:
c=s=>s.split(r=/[aeiou]/ig)
v=s=>s.match(r).join``
j=(a,s)=>(i=0,a.reduce((a,c)=>a+s[i++%s.length]+c))
s=x=>y=>[j(c(x),v(y)),j(c(y),v(x))]
 
00:00 - 15:0015:00 - 00:00

« first day (2687 days earlier)      last day (2147 days later) »