« first day (4364 days earlier)      last day (777 days later) » 

00:14
@Seggan I'm fully expecting to get rickrolled.
@AviFS promise. no rickroll
you dont have link previews?
@Seggan I know, I know. It wasn't.
My list contains a lot of stuff that isn't talking about myself
But I fully expected it to be.
Based on the name, I mean. I didn't mean because you said it
@emanresuA NOOOOOOOO
I actually...
Damn.
I had to fulfil your expectations
00:18
<3
I appreciate you.
@RadvylfPrograms the new posts page seems to be broken
it just stays as a 404
doesn't overwrite the page
I love that you took that domain. Did you just do that?
The query is even plausible, lmao. I applaud the effort.
@lyxal It's been broken for like a year now at this point
Going to make a better version of it at some point that doesn't rely on cursed overriding of 404 pages
@AviFS It's existed for a while. The 404 page is a rickroll.
So (IIRC) it's ignored by previews?
@emanresuA Oh wow, that's clever.
Are there any pages that actually do exist, though?
Cuz the homepage is a 404 then, too.
@RadvylfPrograms Discorded ya
00:48
lol
that's amazing
01:14
What a sick joke!
I know gpt swapped those numbers. I knew it was 1216, one after Magna Carta. As if I could ever make such a mistake. Never, never!
That autocompletion! Are you telling me an AI just happens to write a code golf answer like that? No, it orchestrated it - gpt. It defecated through a sunroof!
 
2 hours later…
02:49
What's the program called where if it's the input is true, the program terminates, and if it doesn't it loops?
Inverted truth machine?
I'd just call it a truth machine tbh
Yeah, sorry, I was thinking of a truth-machine. I just found the word. Thank you.
03:12
Guys, how often does BF win?!!
0
A: Halt with 50% non-Halting

AviFSRandom Brainfuck, 5 bytes How often does Brainfuck take the lead? ?[--] Try it online! Random BF extends BF with just one more primitive. It adds the ?, which generates a random byte and stores it in the current cell. That is, it generates an integer from 0-255. Given that there are an equal amo...

Granted, it hasn't been touched in years. I'm sure one of the modern langs could beat my BF in a jiffy.
@AviFS *tie
4
A: Halt with 50% non-Halting

ZaqI felt like golfing this one: Befunge - 5 chars ?>< @ (I'm not sure whether this actually works as I don't have a befunge compiler on me)

2
A: Halt with 50% non-Halting

Dave><>, 5 bytes and a beautiful 2x2 square x; >< x sends the instruction pointer in a random direction; If it sends left or right the IP will hit ; and terminate. If it goes up or down the IP will get stuck in the infinite >< loop, being sent back and forth between the two.

*lose
2
A: Halt with 50% non-Halting

hakr14><> x; > Try it online!

Oh, true.
Okay, lemme rephrase, how often do tarpits win? :p
All the time, depending on your definition of tarpit
21
A: Swap every two elements in a list

emanresu A><>, 4 3 bytes i#o Try it online! Lol, ><> ties with beats Jelly & 05AB1E. Terminates with an error. -1 thanks to @Manny Queen. How does it work? The instruction pointer (IP) is currently moving right i Take input as a character # Reflect - The IP starts moving left i Take input ag...

(tied)
03:19
@lyxal I wanna see a Vyxal answer.
(the vyxal answer beats it, but only with a flag)
@emanresuA ...am i missing something or could that just be x;v
i don't actually know ><> so i'm not going to post it just yet :P
That... could be, yes
Big brain
Up or down, it rerolls. Left, it loops. Right, it halts
03:21
I removed the "how often does bf beat" part
@emanresuA i assumed as much but i feel like there might be something off about the probabilities if two people had already not come up with it :P
@emanresuA H flag?
Interesting. We have different approaches
Okay, now you're tied
03:28
1
A: Halt with 50% non-Halting

Kip the MalamutePyt, 3 bytes ɹ`ł Try it online! ɹ get a random bit (0 or 1 with equal probability) `ł loop while top of stack is truthy (1 is truthy; 0 is not)

Well there goes all claims of bf winning
Not that it matters because it's a popcon anyway
So there is no winning as such
Not from any of the new answers :p
@lyxal BUT I CALLED IT
There are like a million and 5 more answers like that in the more modern langs waiting to be fgitwed
You never won at all :p
I even considered posting a bunch of them at once, haha
@lyxal i'm never gonna live this down, smh. it was about brainfuck not about me
If it was normal code golf, bf might have won :p
@lyxal wdym?
03:33
The challenge is tagged popularity contest
Most votes wins
Byte count is irrelevant here
Things can be as long or as short as possible.
10
Q: Remove duplicates from my academic transcript

SimdConsider a list of subject, grade pairs. E.g. [("Latin", "A"), ("French", "A*"), ("Math", "B"), ("Latin", "A*")] The task is to return the same list but with each subject given at most once. Where a subject occurred more than once originally, the returned list should have the highest grade for...

@AviFS I consider Jelly as a tarpit, so all the time :P
I'd call dyadic jelly a tarpit
dyadic jelly is fun :P
03:49
@cairdcoinheringaahing Isn't Jelly a golflang?
The two aren't mutually exclusive :P
wait i totally forgot about dyadic jelly
dyadic jelly sure is special
TC too - caird wrote a fractran interpreter in it
This is also supposed to be an answer, but on TIO it terminates everytime
Does anyone know why?
I believe we talked about monadic jelly?
03:55
I'm wondering if it has to do with this line:
Execution consists of picking, from the list of rules, an arbitrary [emphasis is my own] rule whose original string exists as a substring somewhere in the program state, and replacing that substring by the rule's replacement string.
Jul 13, 2022 at 15:45, by Zion mycelia adamancy
Proof that Jelly is TC when everything is dyadic: FRACTAN interpreter
@emanresuA Monadic Jelly is not TC, pretty sure
I always thought it was random, but maybe TIO is running it in a deterministic order, which would still technically be arbitrary.
Yeah, it definitely shouldn't be terminating for this:
0::=00
::=
0
@cairdcoinheringaahing What are the definitions of monadic and dyadic jelly?
@Bubbler Every chain, link and sublink must have an arity of 1 or 2, depending on the type
I guess it applies to the result of a quick too?
03:58
Aka, if you put the code into Jelly's chain parser, the arities are all the same (aside from the variadic arity for the first chain)
@Bubbler Yep
/ can't be used in dyadic Jelly for example, as it forces the link to be monadic
@AviFS It looks like TIO's thue interpreter file is compiled, so I'm not exactly sure which one it uses
@cairdcoinheringaahing I think it's wrong.
@AviFS With Cat's Eye Technologies' Thue interpreter I'm at least getting infinite loops for this program, as expected.
@cairdcoinheringaahing So, just to begin with: monadic Jelly can only run programs with a single argument, meaning that if it is used to interpret a program in some TC lang, it can only take the program code as an input, with no input to that program
That said, /// is TC without taking input, so that doesn't disqualify it
it doesn't seem intuitively impossible but it might have to rely heavily on obtuse encodings of the input and the monadic atoms themselves might just not be powerful enough
(aside from the evals of course :P)
While is monadic right?
Not necessarily
It has the same arity as the largest arity as the two argument links
Ok, I think this is a big problem: dyadic jelly can have "nilads", but monadic can't
and it gets funky with dyads because it does a fibonacci style recurrence relation thing instead of reusing the right argument, but it still is dyadic
ooh, yeah that's a big issue
In fact, no matter what you do, you can never have a """niladic""" link in monadic jelly, as every link is an atop, whereas you can in Jelly through dyadic "nullification"
although if you're using some kind of single list to store everything you can still add things to it... you can't add much
@UnrelatedString No you can't
04:11
or the other one i can never remember which is prime and which is prepend 0
You can do things to the input that return a constant... but you can't do anything with thtat
You can't increase the "flattened" length using monads aside from Ż, yeah
@emanresuA you can with quicks, but there's also very little that quicks can do with that
i'm trying to think of something that's somehow based on ¦, but it's not very promising
I believe the only monadic atoms that actually increase the number of elements overall in a list are the range commands and the join commands, neither of which can be used to establish TC-ness
And I guess
17
A: Turing-Complete Language Interpreter

user62131Jelly → "Add minimum to transpose", 5 4 bytes +"Ṃẞ Try it online! (runs only one iteration, to avoid timeouts) A very simple Turing-complete construction: we take a square matrix as a program, and loop forever, identifying the lexicographically smallest row, then increasing each element of th...

Not fully monadic but...
04:16
...entirely unable to be turned into monadic only
Okay, I think this is a sketch proof it isn't TC: a requirement for TC-ness is command sequencing. Due to the parsing patterns, the only way to change command sequencing beyond ABC being executed in order is using quicks. I believe the only quicks that can affect command sequencing order are ? and ƭ. But, ? doesn't affect the order of sequencing, so the argument reduces to showing ƭ doesn't offer the flexibility for TC-ness
...actually +"Ṃ does seem to be possible to turn into ṂƬṖZ€L’$¦SZ
it's still a questionable example since the real thing recurs infinitely but i guess that does work
Wow
Can you add a print?
I think always returns 1 from ṂƬṖ, but not fully tested
it's easy to forget about those :P
@cairdcoinheringaahing Oooooo,h of course, Ƭ
if not then at least shoulf
04:31
Isn't ¿ available?
I always forget that Ƭ is probably the easiest way to concat two lists, so long as you can find some transformation from one to the other and that transformation eventually reaches a fixed point
E.g., if you can find a monadic chain F : L -> M where you want to result in the pair [L, M], such that F eventually reaches a fixed point, FƬṖṖ...ṖṖ will result in [L, M]
Congratulations, y'all have proved monadic jelly TC
From that, you can in all likelihood build arbitrary lists, and you can loop with recursion, and so you have TC-ness
@emanresuA Congrats everyone. We have proved that Jelly, an already proved TC lang, is also TC if we bother to needlessly restrict ourselves to specific subsets of commands :P
now do niladic jelly
I can confidently say that's not TC
Now we need to examine specific Jelly patterns :P
E.g. if all chains, links and sublinks are 2-1 patterns, is Jelly TC? :P
I think that 2-0 patterns are not TC, as you can't actually "internally" manipulate any data :P
04:39
yeah it seems like 2-0 would be very difficult without having intermediate monads under the surface
How do quicks fit in such a pattern?
good question
I think, in this case, you exclude "sublinks"
So, every chain pattern must be 2-0, and every link pattern would be 2-0, but you could have +"5
Or even, +5H¤
Because, something like +5+¤ would be debatable about if it actually fit with the 2-0 pattern if not
04:56
@cairdcoinheringaahing it's not as blatantly impossible as it seems at first considering the existence of the register and some of the things some quicks can do, but i think it's still impossible to create numeric values you don't start with and there's no useful way to use new lists for control flow
@UnrelatedString There's also no way to actually chain links - the entire program has to be a single niladic chain
you could still sequentially replace the register with other stuff but you still wouldn't be able to have any non-constant values exist anywhere else than in the register
@UnrelatedString Exactly - you can't have unbounded memory
But also, you can't use ɼ if you can only use nilads
05:03
If literally everything is a nilad, you have exactly one link before you get to unparseable nilads
congratulations, you've turned jelly into a printer
6
Is that a compliment or an insult?
True Jelly KC programs are just a bunch of unparseable nilads with a 0 prefixed
Jelly KC, as in Jelly programs written in Kentucky?
it is possible to grow some kind of structure but i don't think niladic jelly can even distinguish stages of that, much less use such a distinction
05:15
@UndoneStudios Kolmogorov complexity
@UnrelatedString Also, a truly niladic program cannot take input
of course with a sufficiently contrived encoding Ɠ is tc in and of itself :P
True, Ɠ does evaluate it as Python, so is TC
lol
right, we all forgot about eval
and we even have monadic and dyadic eval atoms
05:26
I feel like eval is cheating in this context
1 hour ago, by Unrelated String
(aside from the evals of course :P)
oh ok
but just for completeness, monadic jelly + monadic eval can execute arbitrary code by composing prepend zero, increment, decrement followed by chr
less clear if the same thing can be done in dyadic jelly + dyadic eval
i don't think there's any way to chr in dyadic
thought the same
0
A: Sandbox for Proposed Challenges

bigyihsuanImplement a bag without replacement Tags: code-golfcode-challengedata-structuresrandom Intro The Tetris Guidelines specify what RNG is needed for the piece selection to be called a Tetris game, called the Random Generator. Yes, that's the actual name ("Random Generator"). In essence, it acts like...

05:50
https://www.wolframalpha.com/input?i2d=true&i=D%5Bf%5C%2840%29x%5C%2844%29y%5C%2841%29%2Cy%5D%3DD%5Bf%5C%2840%29x%5C%2844%29y%5C%2841%29%2C%7Bx%2C2%7D%5D
Isn't there a nice solution?
@l4m2 Reading through this, it's apparently called a heat conduction equation, and:
> the general solution is dependent not only on the equation, but also on the boundary conditions
so I guess there's no nice general solution for that equation if you don't provide boundary conditions
I tried discretizing with dt=2dx^2 and get it's u(x,t+c)=∫[R]u(x+v/4,t)erf'(v)/2dv
da hell is this big brain math stuff lmfao
dt=2dx^2 mean u(x,t+dt)=(u(x-dx,t)+u(x+dx,t))/2 to easier handle
06:05
PSA: CGCC is not a deep math forum
5
What's about Professional Sports Authenticator :(
@l4m2 man i have no idea what that is, i only got up to single variable calc lolol
PSA = Public Service Announcement
 
2 hours later…
08:36
0
A: Sandbox for Proposed Challenges

mousetailEstimate the world population, at 5 different levels of accuracy code-challenge Your goal is, given a year between 1951 and 2020 to output the world population in that year. However, you must write 5 different expressions. Each program must contain the previous as a substring. Your first program ...

 
1 hour later…
09:51
0
Q: Is outputting by modifying an input with no modifying access allowed?

l4m2Say Round to nicer numbers where it's possible to always output n'=m. I submitted a Javascript solution that does this. I can require input be f(x,[n],m) and then it's modifiable, but this doesn't apply for languages like C.

10:15
0
Q: Let's write a LOLCODE converter!

DanutWrite a program to convert any LOLCODE code in a language, say Python or Java. For example this code: HAI 1.2 CAN HAS STDIO? VISIBLE "Hello, world!" KTHXBYE can be translated to this: print("Hello, world!") Or this code: HAI 1.2 CAN HAS STDIO? I HAS A VAR ITZ 4 VISIBLE VAR KTHXBYE can be transl...

10:33
I wouldn't be surprised if it's partially copied from an existing question
They also seem to be obsessed with something called grasshopper JS which they can't even spell correctly
11:20
Sandbox, which means good idea not ready, which means good idea ready, which means bad idea? there's only 2 voting buttons
11:52
@NewPosts this guy again
@emanresuA so far all of his questions seem to have been
Where they deleted?
what?
I don't see any other posts on his profile
oh, I guess so?
there was a ripoff of my Ukrainian flag challenge yesterday
0
A: Sandbox for Proposed Challenges

l4m2Connect WEST and EAST using n pipe. This is an example output, where n=9. You can make sub-component, which each pin behave an extra pipe. Sub-component cost 2 pipe. Following is n=19. (The sub-component at the center is image above) You can also make sub-component in sub-component, and et infin...

nothing special
12:29
@Ginger Seems alright for a easy difficulty challenge
can the sequence be taken as a list of digits?
13:13
@lyxal Yes, lemme add that
:+1:
literally too
lol
I'm gonna go ahead and post it
when you do, I'm gonna go ahead and answer it
13:17
@mousetail I like easy challenges because it increases the variety of languages that can be used to answer
There's defiantly room for them
I can't answer a super-hard challenge in makina because it's not a super-complex language
0
Q: Find the first run of numbers summing to n

GingerGiven as input a positive nonzero integer n and a sequence of digits 0-9 (which may be taken as a string or a list), find the first contiguous subsequence of digits in the sequence that sums to n and output the start and end indexes. You may use zero- or one-based indexing. If no such subsequence...

boom
now I sit back and watch the rep roll in
or roll out
13:19
let's hope it's not that awful :p
wait wtf lyxal
lol
that's not very [Big Shot] of you kid
marginal amounts of trolling
@Ginger @RadvylfPrograms @mousetail have y'all seen that the PLD site only needs 15 more questions with 10+?
I have in fact
very hot && spicy
we might make it after all :b
We need more promotion again
13:28
have you made sure to redistribute your votes?
lemme go check
107 questions holy fricknuts
@mousetail it seems to be going fine - every day I check, there's 2 or so new followers
so people are still visiting and voting, which is good
We want to be prepared for the comitment stage
I'll handle that when the time comes
we're almost at 150 followers!
@lyxal do you think it's worth doing another round of ads?
13:32
for the commitment phase, yes
for the proposal phase, no
also, you should seriously consider a career in marketing if this programming thing doesn't work out
the programming subreddits might consider more ads for proposal a repost at this time
like your bio ad for the site is really impressive
what, you mean the blurb in my main profile?
yeah
13:33
autogenerated by area 51 :p
bruh
whoops lol
even besides that you managed to get us almost 150 followers in a week
well that's just posting a link on a subreddit
pretty easy to do
okay I guess
I mean, sure, having an account that's a few years old and has 23k karma is probably helpful in that case, but like 99% of things that aren't "hey look at my personal project" are upvoted
that reminds me, I missed my cake day gosh dang it
14:20
You can always have cake in your heart
@lyxal But I baked cake last night!
Can I have some?
Sure. When are you next visiting Elsinore, Denmark?
Maybe this summer
Or at latest in October, if you plan on winning the grand prize…
14:44
@cairdcoinheringaahing That sometimes annoys me, because the duplicate question sometimes contains relevant info that I can't see without signing in
im actually getting annoyed now...why do people think i hack or am related to termux .. because the people that recently start following me have followed other "hackers", termux
atleast 50% of my followers are like that
15:47
you sure you're not a 1337 h4x0r?
16:04
@Ginger 420% sure
considering switching to codeberg lmao
16:28
0
Q: Form a subset that is a continuous range

mousetailGiven a list of lists of positive integers, output a subset of them so their union forms a continuous non-empty range with no numbers missing. For example, consider this input: [ [1, 2, 3, 5], [2, 4, 6], [7, 9, 11] ] The union of the first 2 forms a continuous sequence: [1, 2, 3, 4, 5, ...

16:41
CMQ: I'm designing a language and am considering allowing certain cases of a public enum or certain fields of a public struct to be marked private. Is that something that would be useful to add to a language?
Minor follow-up: If it would be useful, what's a three-letter keyword that could be used for marking stuff private? (I'm using pub for public currently)
no.
A firm "no" is the best way to establish boundaries
@user shh :p
17:01
> A regular expression (also known as a "regex") is a coded phrase in a specialized syntax, used to pattern match against character strings. A common regex is "*" meaning "anything".
17:37
Anyone know what Conor O'Brien's bounty here was for?
Was it awarded recently?
Ay, woke up to it this morning (GMT).
@user yes
not enum, but struct
@Shaggy I think I do vaguely remember this now. The bounty was for the shortest answer to that question. Your 25-byte version was already the shortest, even before you golfed it in half. (Impressive!)
18:02
40
Q: Binary to decimal converter

Stewie GriffinBinary to decimal converter As far as I can see, we don't have a simple binary to decimal conversion challenge. Write a program or function that takes a positive binary integer and outputs its decimal value. You are not allowed to use any builtin base conversion functions. Integer-to-decimal...

@Shaggy Incidentally, I tried porting your 12-byte solution to Pip, and came up with exactly the same thing as my existing 27-byte Pip solution. I'm particularly envious of the way Japt's scoping rules seamlessly handle the mapped function and the recursion. In Pip, I had to use a for loop.
18:14
@Seggan In that case, do you think marking the struct as public should make all the fields public by default and require a modifier to make them private, or should marking the struct as public still require manually making individual fields public?
Rust makes you put pub on each individual field but I find that kinda annoying
@DLosc That's because Japt is built on JavaScript.
@DLosc Not so impressive; the original was a horror show! Don't know what I was thinking!
This is a great answer from a new user that unfortunately didn't get any upvotes until I upvoted it just now (it was posted in March 2021).
18:35
@user 1st option
18:45
Yeah I was thinking the same, I just don't want to add a priv or private modifier :|
@Shaggy By the way, my JS answer was a port of G.B's Ruby answer, which was a port of pxeger's python answer.
Ports all the way down :P
@DLosc Poor who cares just posted that one answer and never came back :(
they didn't care enough :b
19:09
0
Q: Fewest dice rolling as dice rolling

l4m2Related Now you have some dices, and you may role for several times. You need an uniform random integer between 1 and \$n\$, inclusive. Show a method that roles fewest time and behave as an \$n\$-sided dice. Alternative question: Given set \$S\$ and \$n\$, pick fewest element from \$S\$(each elem...

19:51
@DLosc hello!
20:03
@DLosc I always upvote even moderately good answers in the FA queue, and I'd recommend anyone reviewing to do that too
...why did four people get the same FA review task
All four of these are the same answer
DRAW THE NATIONAL FLAG OF FRANCE
 
2 hours later…
21:45
@RadvylfPrograms Clearly every FA review needs moderator approval :P
 
2 hours later…
23:15
> Chat is also a strange place and it does things no one expects. - Catija
3
A: Chatterbox and Verified hats considering the same room as if belonging to different SE sites

CatijaThe two hats are implemented differently, which is the crux of the situation. This is likely due to the fact that one is reused from a previous year and one was created this year. Chat is also a strange place and it does things no one expects. Basic chat "parenting" overview: Feel free to skip ah...


« first day (4364 days earlier)      last day (777 days later) »