Content-Type: text/shitpost


Subject: Spelling gloating
Path: you​!your-host​!wintermute​!uunet​!batcomputer​!plovergw​!plover​!shitpost​!mjd
Date: 2021-03-14T14:39:07
Newsgroup: misc.spelling
Message-ID: <084f698653d28728@shitpost.plover.com>
Content-Type: text/shitpost

Pretty pleased with myself today for spelling “Aung San Suu Kyi” without having to look it up.


Subject: Worst Nobel Peace Prize recipient update
Path: you​!your-host​!walldrug​!prime-radiant​!computer​!hal9000​!plovergw​!ploverhub​!shitpost​!mjd
Date: 2021-03-14T14:33:12
Newsgroup: rec.pets.worst-nobel-peace-prize-recipient
Message-ID: <ed374d5d910fe79e@shitpost.plover.com>
Content-Type: text/shitpost

Previously, I had some suggestions.

Since then, Aung San Suu Kyi has been looking like a good choice.

Also, since they apparently gave Obama the prize for not being George Bush, they should give Joe Biden two prizes for not being Donald Trump.


Subject:
Path: you​!your-host​!walldrug​!epicac​!ihnp4​!hal9000​!plovergw​!shitpost​!mjd
Date: 2021-03-14T14:15:51
Newsgroup: talk.mjd.ugh
Message-ID: <d0e8133181e8e74c@shitpost.plover.com>
Content-Type: text/shitpost


Subject: A formal language puzzle
Path: you​!your-host​!walldrug​!central-scrutinizer​!fpuzhpx​!plovergw​!ploverhub​!shitpost​!mjd
Date: 2021-03-14T14:09:10
Newsgroup: comp.lang.haskell.formal-language-question
Message-ID: <d72be256bce765f7@shitpost.plover.com>
Content-Type: text/shitpost

Suppose !!\mathcal L!! is a regular language and there is some string !!t!! that is a substring of every element of !!\mathcal L!!.

Is it necessarily the case that there must exist regular languages !!A!! and !!B!! such that $$\mathcal L = A t B?$$


Subject: Variation
Path: you​!your-host​!walldrug​!epicac​!thermostellar-bomb-20​!skordokott​!berserker​!plovergw​!shitpost​!mjd
Date: 2021-03-06T00:49:08
Newsgroup: talk.bizarre.rsl
Message-ID: <6e315d10192ecea2@shitpost.plover.com>
Content-Type: text/shitpost

Fuck, Marry, Kill, except it's Rum, Sodomy, and the Lash.