« first day (3852 days earlier)      last day (989 days later) » 
00:00 - 15:0015:00 - 00:00

3:13 PM
@hyper-neutrino If 2 users complete a "Delete" review in the LQP queue, then it take 4 more "Recommend Deletion" reviews to delete it (and 1 "Delete" requires 5 "Recommend deletion"). However, 3 "Delete" reviews will delete it, regardless of how many "Recommend Deletion" reviews were done. So you can have anywhere between 3 and 6 reviews to delete a VLQ post
(Ignoring mods who make 1 and 2 reviews possible as well)
 
Or, if a mod tracks down where the user lives and forces them to delete it themselves, 0 reviews :p
 
@Dudecoinheringaahing huh... interesting
 
Hello all
@exedraj are you about?
 
in Vyxal, 2 hours ago, by exedraj
Well that's it for me for the night
 
@AaronMiller thanks!
Could someone do me a coding favour please. I am away and just have my phone so can't write code :(
 
3:26 PM
I love how the latest spam post is tagged "error correction"
Because it's about how to fix an error
 
lol yeah
 
This should be really easy in python and probably lots of other languages
 
We're not doing good today, it's been multiple minutes and no nuke :/
 
@Anush What is the task?
 
@Adám I just want to know if abcde has a maximal number of other strings within Levenshtein distance 2 . That is, is there another 5 letter strings over the alphabet a-e which has more strings within Levenshtein distance 2?
The first step is to count how many strings are within Levenshtein distance 2 of abcde which you can do just by brute force
 
3:32 PM
Is there any reason for this?
 
I know that aaaaa has a minimal number so it seems reasonable that a string with all distinct letters is maximal but is it true?
 
You can probably brute force it
 
@RedwolfPrograms I am interested in the size of the Levenshtein ball. It's apparently useful but I like the question independent of how useful it is :)
 
There's 3125 strings of a-e with a length of 5, and each probably has under 10k strings with a distance of 2
 
If the maximum is not that much larger than the minimum that will be interesting
@RedwolfPrograms that would be interesting to know. If abcde gives the max we just need to check that one string
If it's true for length 5 I suspect it will be true for all string lengths
 
3:37 PM
I'd expect any string without two consecutive identical characters to work
 
@RedwolfPrograms that poses a really interesting question already!
It shouldn't be hard to test in code
If you have a library function for Levenshtein distance
I would be very grateful if anyone could test this
 
CMC given a string of length 5 with letters from the alphabet a-c, report how many strings are within Levenshtein distance 2 of it
I meant a-e !
 
4:13 PM
 
I guess I could pose it on main?
 
@Anush One problem is that challenges about Levenshtein distance are almost always dominated by having to implement Levenshtein distance
Either that, or you have a builtin for it which makes it not very interesting
 
@Dudecoinheringaahing if you use a library how would you do my challenge?
It's not hard to implement a way to calculate the levenshtein distance
 
@Anush Probably by generating all strings of lengths up to 7, calculating Levenshtein distance for each with the input, count number of 2s
 
@Dudecoinheringaahing that sounds good to me. Do you program in a language that has a levenshtein library call?
 
4:28 PM
No, but I know that 05AB1E has one
 
That's cool. Although I have never used it
What is your favourite language?
 
Probably Jelly
Actually, I should add a levenshtein distance builtin for my Jelly fork
 
ŒP€f/ṪLạẈS :)
@Dudecoinheringaahing that would be cool
Can you read the code I just posted?
Pasted
 
In Vyxal, overloads to Levenshtein Distance: Try it Online!
 
@Anush Yes, but I'm not sure what it does as a whole. You're getting the powerset of each element in a list, then keeping the elements that appear in all of them, then taking the last one's length (call that L). Then you get the lengths of each element in the input, get the abs differences with L, then take the sum
 
4:34 PM
@Dudecoinheringaahing it computes the levenshtein distance
 
Between what? A pair of strings?
 
ŒP€f/ṪLạẈS
€ On each of the original strings
ŒP produce all possible subsequences of the string;
f take the list of common elements
/ between the first and second sets of subsequences;
L take the length of
Ṫ the last of these common elements;
ạ take the absolute differences between that and
Ẉ the length of each {of the original strings}
S and sum them.
Yes
Perhaps not the most efficient method
 
1
A: Find the minimum edit distance between two strings

ais523Jelly, 10 bytes ŒP€f/ṪLạẈS Try it online! A port to Jelly of my Brachylog answer, saving a few bytes through more convenient plumbing and some convenient builtins (and beating the builtin-based practical language answers by being shorter than the word "Levenshtein"). This is a function submissio...

It's not by me
 
> Insertions and deletions cost 1, and substitutions cost 2
 
4:38 PM
@Dudecoinheringaahing ah ok
 
So that answer essentially ignores substitutions, as when they cost 2, they're equivalent to an insertion and a deletion
Interesting that the Levenshtein distance question doesn't have a Jelly answer
 
I came up with something kind of cool
Take an array of tuples, containing two pointers to locations in the array
Now, starting at one of the tuples, take the first and second pointer. I'll call them i and j. Replace the tuple with the one at i, and jump to j.
As an example, [[0, 1], [2, 0], [3, 1], [4, 0], [2, 0]] would cause the instruction pointer to infinitely loop in a 0, 1, 0, 1, 1 pattern
If you output the instruction pointer prior to each jump, I believe you can use this to print any output which eventually repeats.
 
@Dudecoinheringaahing you should fix that!
 
5:01 PM
@RedwolfPrograms It can also have an arbitrary prefix that doesn't repeat
 
@RedwolfPrograms This might actually be turing complete
If you take input by appending pointer tuples in a certain pattern, I could see it being possible
Not sure how output would work yet
Maybe by going to a special output pointer at -1
Almost reminds me of the waterfall model
Wait, it can't be turing complete since it doesn't have any way to do unbounded storage
Well it might be a bounded storage machine, then :p
 
5:22 PM
0
A: Sandbox for Proposed Challenges

Pro QWho Won Tic-Tac-Toe? Your job is to be the judge of a game of Tic-Tac-Toe. Given an input consisting of three lines (9 characters not including newlines), determine the winner of the game of Tic-Tac-Toe. For example, for the input XOO -XO O-X your program should either return or print X. For tie...

 
@RedwolfPrograms Correction: Linear bounded automaton
 
Did anybody here have a chance to look at codegolf.meta.stackexchange.com/a/23793/55934
 
@NieDzejkob I'd recommend adding a test case with 2 or more r> and >r, as currently, a simple register would work
 
Seems like a really cool challenge, though
 
5:37 PM
I'd also suggest adding a complex example (e.g. swap >r dup r> swap drop) and work through the stack trace, just to make it a bit clearer
 
Who updates the featured language on esolangs? Thue's been there for as long as I can remember, and that's at least four years IIRC
 
It's just that good a language
 
According to the page about featuring languages, Funciton was featured from Jan - Mar 2019.
And BF was featured for ~6 years, from Oct 2013 - Jan 2019. source
 
@RedwolfPrograms esolangs.org/wiki/Esolang:Featured_languages: "Languages are proposed by users of this wiki, and selected to be featured by an administrator"
 
I guess the administrators are really a fan of thue then lol
Or just super inactive
 
@AaronMiller branfuck must have fcked with the brain of whoever updates the page
 
> Every so often (we're not sure of the exact time span yet), an administrator will choose a language from the available candidates
 
Welp, I guess every so often is every 100 years then
 
Sounds about right to me
 
Huh, I had no idea that Pxem came out in 2008
> Thue is an esoteric programming language based around the idea of a "semi-Thue system"
Did anyone else know that SE supports relative links? Open the Ask page, and type [abc]\n\n[abc]: /q/1 (\n being literal newlines) and it should show a hyperlink to codegolf.stackexchange.com/questions/1/just-another-perl-hacker
 
5:57 PM
Doesn't MD always let you do that?
 
6:15 PM
If you put that in a comment, and you quoted it in chat or somewhere, would it be relative to chat instead?
 
I don't know, let's see
(I would test in the Sandbox, but it has no parent site so can be weird)
 
Huh, still links to meta
Dang it I got the quote wrong D:
It's supposed to be "deals"
 
So with chat, /<path> leads to /transcript/path
 
It does?
Are you sure that's not HN's script?
 
Oh weird
That link doesn't work, but the link in chat does Nevermind, I'm an idiot
Ok, so [Link](/message/<id>) gives the source of the message, and [Link](/transcript/message/<id>) gives the permalink
@RedwolfPrograms Hovering over that link shows https://meta.stackexchange.com/x, not /x, so I'd imagine the full link is filled in when posted
 
6:27 PM
The HTML contains /x on meta
So it's being filled in by chat
 
@RedwolfPrograms Probably because when the MD was turned to HTML, it turned the relative URL into an absolute one.
 
7:33 PM
The profiles are getting changed again. Aaron wants your feedback on the features and changes he's demoing, before this is shipped
 
Wow, asking for feedback on new changes! This is a good sign.
Also, it looks like last seen might be back
 
@RedwolfPrograms I think only for mods
 
@RedwolfPrograms Yep. I'm still watching the demo, so I'm not 100% sure/sold on the new changes, but I've upvoted because it's a very promising first step
 
7:55 PM
Hoi
 
Hello there!
 
I'm reading Lyxal's code
It's painful
 
Hello,ㅤemanresuㅤA
 
Ⓦⓗⓨ ⓓⓞ ⓨⓞⓤ ⓤⓢⓔ ⓣⓗⓐⓣ ⓕⓞⓝⓣ
sns ɐpuıʞ
Bye
 
8:12 PM
Goodbye,ㅤemanresuㅤA
 
Just wrote a couple hundred lines of Rust code that's, if I may say so, quite fancy and industry-grade. I think all the abstraction also makes it much cleaner, easier to understand, and more maintainable. What do y'all think of it?
 
Stop stealing stuff from the starb...oh wait you're the one who posted that earlier
So uh...one of the assignments we got for school online had all of the answers filled in already, and I let the teacher know, and they fixed it. But they included a comment explaining what happened and it included my name and I don't think people are that happy with me ._.
 
> I let the teacher know
That's worse than asking if you have homework at the end of class :P
 
He would've realized eventually :p
 
Might even be on par with reminding the teacher to collect the due homework :P
 
8:21 PM
So? Don't be a goody two shoes, Redwolf
 
@RedwolfPrograms Then let him realise, while you keep the copy with the answers :P
 
@Dudecoinheringaahing Almost as bad as reminding the teacher you were supposed to have a test that day
 
Nah, most of the people in my class are annoying and don't pay attention anyway
 
lol
What a classic teacher's pet /s
 
If they don't learn to conjugate verbs now, what'll happen when they need to speak latin in the real world? smh.
3
 
8:23 PM
Yeah, who knows if the Romans from another timeline invent time travel and come here to speak to us?
 
You still study latin? Wow
 
@RedwolfPrograms screwebunt!
 
@user Idk, that's an unforgiveable sin
 
@Dudecoinheringaahing The only other languages they have here are spanish (which I'm already learning elsewhere) and sign language
 
@RedwolfPrograms Why not learn sign language?
 
8:25 PM
@user uwu
 
@user Because there's a million other people who care more about it that me, and only one teacher
 
@rak1507 Wait isn't that an insult?
 
They'd probably run out of room and stick me in spanish
I think they have french, but you can't start it until 10th grade since there aren't enough french teachers
 
iirc it means 'I will sodomise you'
 
Um
 
8:25 PM
We had a kid in our class once who reminded the teacher about the test we were supposed to have. That day, he learnt a lesson not scheduled: snitches get stiches tons of people yelling at him and throwing pencils
 
@user I wish I knew sign language so I could just have earplugs in all day and pretend to be deaf
@Dudecoinheringaahing Well maybe the kid was doing poorly before and needed the test to improve his grades
You know what they say: Always attribute stuff to stupidity instead of evilness because people are dumb
 
I'm not sure that's the exact quote, but close enough :P
 
Couldn't remeber the exact kote bcoz am dum
 
I can't read.
 
Same lol
 
9:08 PM
> Generally a person can leave money to any person or organization that the testator pleases. In some US states, a minimum potion must be left to family (spouse and/or children).
 
9:21 PM
What is a good way to learn Jelly? I've read the tutorial and am very confused. Is there maybe a list of challenges that are simple to solve in Jelly, or perhaps categorized by what features of Jelly one must know?
 

 Jelly Hypertraining

Practice your Jelly :) Rules and stuff are here: golfingsucces...
That's a room specifically for learning Jelly, feel free to request access :)
 
@NieDzejkob If you know APL, you could try J and then ease into Jelly
@Dudecoinheringaahing Why is it private btw?
 
Not sure. I think it's mainly so that we know who's a student and who isn't
 
Ah
 
Pretty sure it started out as Leaky and Erik teaching Hyper, then they accepted more students as more and more people wanted to learn it
 
9:24 PM
@user True. Because the antecedent is false >.<
 
@NieDzejkob This is a good list of exercises to get started with, and hyper has a site specifically for learning Jelly, which is supposed to be good, and I have my (in progress) Recipes for Jelly, which are all good resources to start
Speaking of, I really should do more work on my Recipes for Jelly
 
@NieDzejkob ???
 
@user I'm saying I don't know APL, which makes your sentence true when viewed as a material implication.
 
9:39 PM
Ah
Too many fancy words for me to understand :P
 
Why use lot word when few word do trick? :P
 
Achievement get: make a joke too nerdy for the nerd chatroom
 
Are we the nerd chatroom? Aww, I thought we were the Bad Kids of Stack Exchange :P
 
10:05 PM
There may be lots of nerds on this site, but most of them don't come here, and I'm certainly not one of them :P
 
:) what's your definition of nerd?
 
Whatever's convenient at that time
 
what a coincidence, that's mine too
 
My definition of "nerd" also never includes me :P
CMC for the nerds here: Briefly explain SVMs for a non-nerd and which parameters might be best for different stuff
Alternate CMC for the nerds: Make and train SVMs for me. Since I'm generous, I won't be accepting payment and will let you do it for free (an iced tea would be appreciated, though).
 
10:24 PM
@NieDzejkob I got that joke.
@Dudecoinheringaahing I got that joke too. :P
 
Nerd. /s
 
I'll own that label. Particularly if there's a noun modifier in front of it, such as "linguistics."
 
Joke nerd?
 
From my own experience with the term, I generally prefer geek :P At least in the company I'm used to, nerd implies no social skills, geek doesn't :P
 
@user Eh, not particularly. Math nerd who happens to have watched a lot of The Office clips on YouTube recently. ;)
 
10:27 PM
@Dudecoinheringaahing I think geek mostly just implies knowing a lot about some topic and being excited about it, whereas nerd kinda implies being good at math, science stuff, etc. but not at any real life stuff
 
@Dudecoinheringaahing I'm sure the connotations are different in different groups & dialects. Although I think I remember being told something similar when I was junior-high-school age.
@user What if you're both? /s
 
@user What if you're good at math / science stuff and real life stuff? :P
 
Or that
 
Frickin ninja'd
 
idk lol
I guess you're a chad then
 
10:29 PM
I believe that's what universities term a "well rounded individual" :P
 
@Dudecoinheringaahing Anti-ninja'd, really: I was saying "what if you know a lot about some topic and you're good at math & science and you're not good at real life"
 
paulgraham.com wrote some interesting essays about "nerds"
 
@Dudecoinheringaahing I was grateful that the scholarship I got at university added a well-roundedness test after I'd already received it. :P
 
@Dudecoinheringaahing Wait, I thought they wanted chubby people. Do you mean I've spent the entire summer overeating for nothing? :P
@DLosc If you're good enough at the non real life skills, you won't need to worry about real life skills :P
@Wezl Link?
 
@user [citation needed]
 
10:32 PM
@user As an example: Andrew Wiles :P
 
@user paulgraham.com/articles.html grep for "nerd"
 
1. Come up with cold fusion
2. ???
3. ???
4. ???
5. Profit
 
Come to think of it, maybe my positive view of the term "nerd" comes from the Age of Empires II (and possibly other RTS games) usage "micro-nerd," meaning somebody who's extremely good at micromanaging their military units in battle.
 
On a tangent, but I had that game! My uncle gifted me a CD or something with it
 
CMC: Implement a bijection between full binary trees (all nodes have 0 or 2 children) and the integers
 
10:37 PM
Including negative integers?
@user Neat! Yeah, it's experienced a big resurgence over the past few years.
 
Your choice to include negative integers, or just use naturals
 
And it's just the structure of the tree that counts, right? The nodes don't have values associated with them?
 
@DLosc Well, I only played it a couple times, realized I sucked at it, and then deleted it to save space or something, but I do remember thinking it was a cool game :P
 
@DLosc Yes. If you'd like, you can require the tree to only have integer nodes in practice, but it should work (in theory) for any values
 
Can I represent each node as a list of children (leaf node == empty list)?
Seems like the most obvious format.
 
10:43 PM
Yeah, that seems fine
 
@Dudecoinheringaahing So then something like this (not sure how to score it). TI is a function that maps trees to (nonnegative) integers, and IT maps integers to trees.
 
@DLosc Ooh, nice. How does it work?
 
Tree-to-integer is basically just "count the depth." Integer-to-tree is "start with empty list and wrap two copies of the previous level in a list N times." Both are recursive functions.
 
@Dudecoinheringaahing ruby, 45b, tree to integer, r=->t{t ?t.map(&r)*''+?1:?0};->{r[_1].to_i 2}, takes Tree = nil | [Tree,Tree]
 
If the CMC submission can be two separate full programs, then a?URE@a0 and a?[RE Da]RL2l work in modern Pip with -xp flags, for 8 + 14 = 22 bytes total.
 
11:00 PM
@DLosc That isn't a bijection
 
@Bubbler No? These are full binary trees without values on the nodes, which means that there's only one possible tree of a given depth, if I'm not mistaken.
 
Aren't these both full binary trees with a depth of 3?
 
Oh. I am mistaken. :P
 
Oops, wrong ping
 
Making assumptions based on the natural language meaning of "full" instead of taking the spec at face value... smh. Somebody revoke my nerd card. /s
 
11:08 PM
Actually I was also confusing full binary trees and complete binary trees
 
And what I was thinking of is called "perfect" binary trees.
 
Got to love all the different terminology :P
 
Damn mathematicians :P
 
Nah, math isn't the problem. Trying to map math to English is the problem.
Actually, in this case, that's not even the problem. "Every node has either 0 or 2 children" is perfectly clear (if you know the definitions of "node" and "children"). The problem is trying to come up with a single-word name for each type of tree.
 
Easy, just do what german does and concatenate a sentence together :P
(I don't know if that's what it actually does, but it always looks like it when I see German somewhere)
 
11:15 PM
@DLosc And when they can't, they just put the name of the inventor :P
Really it happens all over mathematics (including computer science)
 
@user Usually it's just a string of nouns. ;)
 
NodeZeroTwoChildrenTree
 
Hmm, yeah... maybe something like ZeroOrTwoChildNodesTree.
But then we run the risk of math terms that look like they were invented by a Java programmer. :P
 
Somewhat relevant article (no, I'm not linking random Scala stuff just for fun)
@DLosc zero-or-two-child-nodes-tree and now you have a Lisp programmer :P
@user [context: Dotty (now Scala 3) was a major rewrite of Scala. This is an April Fools' article that pretends they're going to make Scala 3 German (Skala 3). Apparently, the example program actually worked (and maybe still does)]
 
11:33 PM
@user Much better :D
 
> We took choosing the new German keywords as an opportunity to improve upon their old English variants. For example, ich sounds much more personal than this, implementationsdefiniert conveys the meaning of abstract so much more concretely, and erbt saves typing a few characters over the more verbose extends.
 
@user Ich lache X^D
 
You laugh?
 
Ja, klar ^_^
 
Ich bin brot
^ That's the only German I know
 
11:38 PM
(I think a better translation would be "I'm laughing," but my grasp of German idiom is extremely barbaric, so it's possible I'm way off base)
 
You're probably right, Google Translate isn't known for its accuracy
 
@user This article that Adám linked compared learning Haskell to learning German, and I thought it was a good comparison. Case in point: it's "Brot," not "brot," because German capitalizes all its nouns. :P
 
Ah
You have summoned Adám :P
 
Apparently!
@Adám Interesting read, that functional programming article. I've tried to Learn Me a Haskell for Great Good a couple of times and not gotten much of anywhere... maybe I should start with Elm like that author suggests.
 
function fib(n) {
var a = 1,
b = 0,
fn;

for (var i = 0; i < n; i++) {
fn = a + b;
b = a;
a = fn;
}

return fn;
}
That's what codex says is Fibonacci without recursion
Using js
 
11:44 PM
fn is a particularly unfortunate choice of a variable name, methinks... I guess it stands for "fibonacci number," but my brain automatically reads it as "function"
 
@user Yup, I felt a calling, got out of bed, and turned my PC on (it is 00:45 here).
 
"It's worse than what Father says about living at the mercy of the telephone."
 
00:00 - 15:0015:00 - 00:00

« first day (3852 days earlier)      last day (989 days later) »