i put neovim inside stack exchange chat

@HyperNeutrino You might actually be able to do it in stack cats since stack cats programs are mirrors not palindromes.

can someone please screenshot the PPCG memes post? I am unable to see it because of rep requirement changes

@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...

@HyperNeutrino I was previously able to see it though. with the site graduation i lost that ability

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

I still don't think moderation ability should be correlated with ability to golf code well

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.

Oh, RIP Stack Exchange

Annnnd we're back

@Veskah That’s a valid message even outside of maintenance time tbh

Heh

@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?

@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

@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

@KritixiLithos Well do you want it before or after the heat death of the universe?

if it halts I don't care when it finishes

@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

@dzaima ah nice model, but I don't understand why it might not be describable

@KritixiLithos what format for describing the equation would you propose that would allow for describing O(TREE(n)) without a built-in?

TREE = en.wikipedia.org/wiki/Kruskal%27s_tree_theorem?

@KritixiLithos yeah

Well. This room seems quite dead compared to days (years?) gone by :(

Hiya Bigtoes. Yeah, some days are more quiet than others, and it seems to be trailing more into quietness, too.

No more Penguin and Menace, I see.

indeed :(

Well hell

Damn shame

I blame myself. Obviously, my lack of presence has had a devastating impact on morale

You have brought ruin upon us

Not sure what an appropriate punishment would be for this transgression. Obviously exile wouldn't solve anything.

oh hey it's geobits

Exile would only make the problem worse

i'm amoosed that you're back

"Back" is a strong word ;)

"Visiting"?

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.

SE Central? Sounds ominous.

Super ominous. On a side note, I smell burning paper and hear shredders working. I certainly hope those aren't notes and/or scribbles.

what an udderly ridiculous accusation

Howdy everyone!

Is that "A_"

No, not at all.

hmm... what did your name used to be

It's always been Jono2906...

not ringing a bell