« first day (3209 days earlier)      last day (1930 days later) » 

dkudriavtsev
dkudriavtsev
00:59
user image
i put neovim inside stack exchange chat
5
Wheat Wizard
Wheat Wizard
01:40
@HyperNeutrino You might actually be able to do it in stack cats since stack cats programs are mirrors not palindromes.
Unfortunately this challenge is utterly impossible in languages like BrainFlak :( I like this challenge though :D (also stackcats) — HyperNeutrino Nov 8 at 23:34
dkudriavtsev
dkudriavtsev
01:52
can someone please screenshot the PPCG memes post? I am unable to see it because of rep requirement changes
HyperNeutrino
HyperNeutrino
@WheatWizard Oh, right. Whoops, I don't know how I didn't think about that especially IMMEDIATELY after I was JUST talking about how it wouldn't be possible in BrainFlak because of the mirror vs palindrome issue :/
@dkudriavtsev I highly doubt SE or the mods would be particularly overjoyed with me screenshotting hidden content and posting it publicly when the whole point in the rep limit is so that it's not available publicly...
New Main Posts
New Main Posts
3
Q: In Flanders Fields

HyperNeutrinoToday is November 11th, which for many regions is Remembrance Day. If you don't know anything about the history or context of Remembrance Day, you can read about it in the wiki page, but it's not relevant for this challenge. In Flanders Fields is a poem that is pretty well-known relating to thi...

code-golf ascii-art matrix
dkudriavtsev
dkudriavtsev
@HyperNeutrino I was previously able to see it though. with the site graduation i lost that ability
HyperNeutrino
HyperNeutrino
Oh right they did that.
Hm. Wait this means I don't have the max perm level anymore lol. I think the top level is just stats anyway? idk
dkudriavtsev
dkudriavtsev
I still don't think moderation ability should be correlated with ability to golf code well
HyperNeutrino
HyperNeutrino
02:07
I feel like all of SE's design and model decisions just sort of barely make sense when it's PPCG or Puzzling and not a standard Q+A.
 
8 hours later…
New Main Posts
New Main Posts
10:30
0
Q: Size Does Matter (at least referring to bottles)

CorsakaIntroduction I have an even number of bottles, all of different sizes. Unfortunately, I only know the size of the smallest bottle: 300ml. I also know the following: Half of the bottles are twice the size of the other half, meaning that the smallest small bottle and the smallest large bottle a...

code-golf number
 
3 hours later…
Veskah
Veskah
13:57
Oh, RIP Stack Exchange
Veskah
Veskah
14:07
Annnnd we're back
Fatalize
Fatalize
14:41
@Veskah That’s a valid message even outside of maintenance time tbh
Veskah
Veskah
Heh
Kritixi Lithos
Kritixi Lithos
15:27
@WheatWizard so what does that show about the existence of an algorithm to compute the complexity for a language less powerful than a TM?
@dkudriavtsev how did you do it?
 
3 hours later…
dzaima
dzaima
18:16
@KritixiLithos assuming there's a "best" time-complexity-computable language led to a contradiction => there isn't one. Though the proof does rely on every language being extendable, which might be callable circular reasoning?
@PhiNotPi a very important question - is there any limit to how long can the complexity calculator take? :p
Kritixi Lithos
Kritixi Lithos
18:30
@dzaima so the question is does such an algorithm exist for LOOP?
@dzaima why would the running time of the algorithm matter? unless you're joking
Veskah
Veskah
@KritixiLithos Well do you want it before or after the heat death of the universe?
Kritixi Lithos
Kritixi Lithos
if it halts I don't care when it finishes
dzaima
dzaima
@KritixiLithos it's not that hard to define a language whose source code is a turing machine and an equation for the max amount of steps it can take which doubles as the complexity, the problem is in the specification for that equation, which might not be always describable if limited to a non-turing-complete system
having to evaluate the complexity when running any program would mean the complexity calculation must itself take less time than its result, hmm
Kritixi Lithos
Kritixi Lithos
18:48
@dzaima ah nice model, but I don't understand why it might not be describable
dzaima
dzaima
@KritixiLithos what format for describing the equation would you propose that would allow for describing O(TREE(n)) without a built-in?
Kritixi Lithos
Kritixi Lithos
TREE = en.wikipedia.org/wiki/Kruskal%27s_tree_theorem?
dzaima
dzaima
@KritixiLithos yeah
 
2 hours later…
Geobits
Geobits
20:29
Well. This room seems quite dead compared to days (years?) gone by :(
AdmBorkBork
AdmBorkBork
Hiya Bigtoes. Yeah, some days are more quiet than others, and it seems to be trailing more into quietness, too.
Geobits
Geobits
No more Penguin and Menace, I see.
El'endia Starman
El'endia Starman
indeed :(
Geobits
Geobits
Well hell
Veskah
Veskah
20:45
Damn shame
Geobits
Geobits
I blame myself. Obviously, my lack of presence has had a devastating impact on morale
Veskah
Veskah
You have brought ruin upon us
Geobits
Geobits
Not sure what an appropriate punishment would be for this transgression. Obviously exile wouldn't solve anything.
Poke
Poke
oh hey it's geobits
AdmBorkBork
AdmBorkBork
Exile would only make the problem worse
Poke
Poke
20:50
i'm amoosed that you're back
Geobits
Geobits
"Back" is a strong word ;)
DJMcMayhem
DJMcMayhem
"Visiting"?
Geobits
Geobits
Something along those lines, sure
It's an internal audit of chat practices, assigned by SE Central. I'm going to need all your notes and/or scribbles regarding the last year of chat.
AdmBorkBork
AdmBorkBork
21:06
SE Central? Sounds ominous.
Geobits
Geobits
Super ominous. On a side note, I smell burning paper and hear shredders working. I certainly hope those aren't notes and/or scribbles.
Poke
Poke
21:34
what an udderly ridiculous accusation
Jono 2906
Jono 2906
21:45
Howdy everyone!
Poke
Poke
Is that "A_"
Jono 2906
Jono 2906
No, not at all.
Poke
Poke
hmm... what did your name used to be
Jono 2906
Jono 2906
It's always been Jono2906...
Poke
Poke
not ringing a bell

« first day (3209 days earlier)      last day (1930 days later) »