00:03:33 <esowiki> [[LDPL]] https://esolangs.org/w/index.php?diff=60817&oldid=60816 * Lartu * (+1846)
00:41:33 -!- Lord_of_Life_ has joined.
00:44:13 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
00:44:21 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
00:45:02 -!- izabera has changed nick to excusemybeauty.
00:52:12 -!- oerjan has joined.
00:54:24 <HackEso> 11764:2019-03-30 <fizzïe> learn The password of the month is invalid. \ 11709:2019-02-04 <int-̈e> slwd password//s=...-=hty-= \ 11708:2019-02-03 <int-̈e> learn The password of the month is eigthy-three characters long but contains no special characters except for a hyphen. \ 11684:2019-01-01 <b_jonäs> learn The password of the month is "overreachtorridbittenmandible". \ 11653:2018-12-01 <int-̈e> learn The password of the month is "SCALNATUAS". \ 11
00:55:24 <fizzie> I was looking at the per-month record.
00:55:26 <fizzie> `` hlnp -T '{date(date,"%Y-%m")}\n' wisdom/password | uniq | tr '\n' ' '
00:55:28 <HackEso> 2019-03 2019-02 2019-01 2018-12 2018-11 2018-10 2018-09 2018-08 2018-07 2018-06 2018-05 2018-04 2018-03 2018-02 2017-12 2017-11 2017-10 2017-09 2017-08 2017-07 2017-06 2017-05 2017-04 2017-03 2017-02 2017-01 2016-12 2016-11 2016-10 2016-09 2016-08 2016-07 2016-06 2016-05 2016-04 2016-03 2016-01 2014-10 2014-09
00:55:48 <fizzie> It's p. good, though 2018-01 is missing too.
00:56:13 <fizzie> (Well, starting from 2016-03 anyway.)
00:59:34 <b_jonas> timezone offset change in Europe very soon
01:02:11 <esowiki> [[Control Character]] https://esolangs.org/w/index.php?diff=60818&oldid=60814 * EnilKoder * (+875)
01:26:14 <oerjan> `` dowg password | grep 2018-02
01:26:16 <HackEso> 11345:2018-02-15 <int-̈e> learn The password of the month is late.
01:26:23 <oerjan> `` dowg password | grep 2018-01
01:26:35 <oerjan> `` dowg password | grep 2017-12
01:26:37 <HackEso> 11291:2017-12-31 <int-̈e> learn The password of the month is early. \ 11251:2017-12-01 <oerjän> learn The password of the month is equally offensive to all beliefs (but not time zones) \ 11250:2017-12-01 <oerjän> learn The password of the month is equally offensive to all beliefs
01:26:52 <oerjan> fizzie: int-e cheated on that one tdnh
01:28:23 -!- b_jonas has quit (Remote host closed the connection).
02:22:27 -!- Essadon has quit (Quit: Qutting).
02:36:41 -!- excusemybeauty has changed nick to izabera.
02:36:48 -!- izabera has changed nick to izalove.
02:42:11 <oerjan> there are (again) two (?) new users today who seem unable to introduce because their browser autocensor the swearing already on the page :(
02:51:21 <Hooloovo0> I'm not sure we need people who only use browsers with autocensors
02:51:41 <esowiki> [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=60819&oldid=60791 * Oerjan * (+206) Mention censorship issue which has caught out several attempted introductions
02:52:20 <oerjan> Hooloovo0: they'll mess up when editing other pages for sure
02:52:38 <oerjan> i added a note that they must disable it
02:53:05 <Hooloovo0> how did you know it was due to autocensoring?
02:53:34 <oerjan> Hooloovo0: take a look e.g. at https://esolangs.org/wiki/Special:AbuseLog/7340
02:57:51 <Hooloovo0> I'm not sure why someone would write something that only censors writes...
02:58:43 <oerjan> it might censor both ways
03:03:57 <esowiki> [[AlphaBeta]] M https://esolangs.org/w/index.php?diff=60820&oldid=60808 * Oerjan * (+0) /* External resources */ template
03:07:50 -!- GeekDude has quit (Ping timeout: 246 seconds).
03:35:58 <HackEso> 834) <Vorpal> elliott, mostly I want something that takes zero effort to maintain and update once the initial setup is done. <elliott> okay well that is called not linux
03:42:43 <fizzie> It doesn't need to explicitly censor "writes", if it just sanitizes the incoming HTML's text content that will already #### things up in the <textarea> where you edit things.
03:58:17 <Hooloovo0> oh, yeah, I guess that makes sense
04:04:00 -!- oerjan has quit (Quit: Nite).
04:30:19 -!- APic has quit (Ping timeout: 244 seconds).
04:42:44 -!- APic has joined.
05:31:07 -!- Cale has quit (Ping timeout: 250 seconds).
05:42:02 <zzo38> int-e: About those truth for TNT, I was not considering models. [1] and [2] (which are soundness, as you mentioned), is generic and can be applicable to any system, but [3] is with the symbols specific with this system, rather than generic.
05:42:48 <zzo38> Also they say consistent is that x and ~x is not both theorems, but it is specific to the symbols of the system and I think a generic definition would instead be, it is consistent if there exist well-formed nontheorems.
05:52:33 -!- FreeFull has quit.
06:49:38 <esowiki> [[List of ideas]] https://esolangs.org/w/index.php?diff=60821&oldid=59250 * DrMeepster * (+127) /* Game */ Added idea
07:32:59 -!- tromp has quit (Remote host closed the connection).
07:33:15 -!- tromp has joined.
08:07:51 -!- tromp has quit (Remote host closed the connection).
08:26:18 -!- b_jonas has joined.
08:27:13 <b_jonas> oerjan: re autocensor, do you get this from the log of rejected edits or something?
08:27:34 <b_jonas> oh, you link a special page. let me check.
08:29:17 -!- tromp has joined.
08:36:55 <b_jonas> `ehlist http://eheroes.smackjeeves.com/comics/2768624/is-it-over-yet/
08:36:56 <HackEso> ehlist http://eheroes.smackjeeves.com/comics/2768624/is-it-over-yet/: b_jonas
08:44:25 <esowiki> [[User:Cortex]] https://esolangs.org/w/index.php?diff=60822&oldid=60516 * Cortex * (+984)
08:50:51 -!- Cale has joined.
09:39:55 -!- arseniiv has joined.
10:11:35 -!- AnotherTest has joined.
10:11:53 <arseniiv> re model theory: I was pleasantly surprised by models for minimal logic (intuitionistic logic without ex falso quodlibet, ⊦ ⊥ → x). There, ⊥ is basically just another variable name and it shouldn’t be false in all Kripke worlds, if we are to use Kripke models (as of Heyting algebra models, IDK). It makes me for some reason a warm feeling
10:18:29 -!- tromp has quit (Remote host closed the connection).
10:27:19 <rain1> wow thats weird, where can i learn this? about kripke models and _|_ not always being false
10:27:59 <b_jonas> what's this with everyone caring about all sorts of nontraditional logic, and set theory built in them?
10:28:28 <b_jonas> it somehow seems so fashionable there must be some reason why it's important, but I don't really understand why
10:28:55 <b_jonas> it isn't just because some versions of them can be a basis for making theoretical type systems for programming languages, right?
10:56:06 -!- tromp has joined.
11:12:01 <arseniiv> rain1: I have read about it in several places, but finally had understood from Ingebrigt Johansson. Der Minimalkalkül, ein reduzierter intuitionistischer Formalismus. Though I almost don’t read German and had had to re-read that thing several times to get missing pieces. Initially I saw something about this logic in en.wikipedia, and about Kripke models for intuitionistic one… let me remember. Maybe en.wikipedia would be sufficient
11:12:01 <arseniiv> too, but also I had read one Russian textbook on logic basics, and this topic was there as a digression
11:16:16 <arseniiv> b_jonas: IDK, for myself I’m interested in logic for quite a long time, initially because I was bold enough to want to devise a school geometry solver (I didn’t know about Tarski’s algorithm then, and didn’t want to use analytic geometry). Then gradually it occurred to me that the logic is a complex thing in itself and that I had misunderstood boolean algebra before and so on, it was full of disco
11:16:36 <arseniiv> …veries and something, but let’s pretend it was full of disco
11:16:59 <arseniiv> though I’m not that old to it to be so
11:17:06 <b_jonas> tom7 has a game with such a name
11:17:58 <b_jonas> something like "disco? very" where the theme of the challenge was "discovery". he often subverts the theme
11:18:43 <b_jonas> yep, see on http://tom7.org/ in the paragraph that has "Disco"
11:20:04 <b_jonas> it says the game name is "Disco? Very!"
11:22:32 <arseniiv> also now I think classical logic is OK mainly because of it’s the simplest of all, in some sense, and minimal one is interesting to me because it really seems to be minimal one which can still talk about negation (we can take something like positive intuitionistic logic, namely S and K axioms, and add quantification on propositional variables, but it’s obviously a more complex setting)
11:25:24 <arseniiv> b_jonas: oh wow it seems I was on that page some time ago because of destroyfx
11:30:19 <arseniiv> > It's compressed using a bunch of different programs to discourage you from downloading it. Really you should get the finished version above.
11:30:21 <lambdabot> <hint>:1:31: error: parse error on input ‘of’
12:01:12 <int-e> b_jonas: I'll adjust my "more than 100" to "more than 200". This game doesn't know when to stop.
12:01:35 <int-e> (number of levels in Baba is You)
12:03:18 <int-e> shachaf: did you notice the terrible "hidden depths" pun?
12:11:28 <int-e> still 3 achievements to go, I'm afraid.
12:12:38 <int-e> arseniiv: I thought about it, and I don't think this is much of a spoiler. it's a bit like saying that soylent green is a movie about food.
12:13:39 <int-e> it is, but you need inside knowledge to really appreciate what that is really saying.
12:14:14 <arseniiv> mhm maybe, haven’t watched that
12:14:57 <arseniiv> anyway I suspected there should be many levels even from the first level screen with all these unreachable boxes
12:16:14 <arseniiv> uh I’m incomprehensible again. I mean, when I unlocked Water, I suddenly realized there are at least two level screens and the first is almost all locked still
12:37:29 <int-e> Hmm, after 10 levels or so? "water" being "The Lake"? I'm not sure I follow otherwise.
12:42:05 -!- Lord_of_Life_ has joined.
12:42:34 <int-e> arseniiv: If I understand correctly, then yes, the first is still mostly unlocked at that point.
12:42:48 <int-e> And you're still in the sane part of the game :)
12:43:47 <int-e> I guess I'll shut up about this now :)
12:44:31 <FireFly> I need to play more Baba..
12:44:47 <arseniiv> I’m glad there would be something described as “insane”
12:44:50 <int-e> I'll say one more thing... the 200 wasn't an estimate, it's an established lower bound.
12:45:03 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
12:45:03 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
12:45:31 <arseniiv> int-e: now you ARE spoiling :P
12:45:48 <int-e> arseniiv: just keep going :P
12:46:45 <int-e> arseniiv: I'm hoping shachaf will let slip who of us is further ahead in the game at some point, by sharing his lower bound.
12:46:53 <arseniiv> int-e: mm did you see Opus Magnum btw? If it’s genre you’re interested in
12:47:49 <int-e> I saw, decided to pass on it because I still have a few other Zachtronics games unfinished.
12:48:31 <arseniiv> I decided to play this one first and then think about others
12:48:45 <int-e> (And I really prefer the programming ones because they tend to have more clear-cut semantics. The 2D Zachtronics games tend to have annoying asymmetries. As does the 3D one.
12:49:28 <arseniiv> there is a 3D one? Seems I didn’t read enough
12:49:38 <int-e> (I've played Space Chem a bit, and learned that it makes a difference for handover whether it's from red to blue or vice versa)
12:49:43 <int-e> arseniiv: Infinifactory
12:49:45 -!- tromp has quit (Remote host closed the connection).
12:49:58 -!- tromp has joined.
12:50:17 <arseniiv> int-e: thanks! I’ll take a look what it is
12:51:22 <int-e> (That one is unfinished as well... it was fun for quite some time but in the end the designs get intimidatingly huge.)
12:53:24 <FireFly> I never really got into spacechem for whatever reason
12:53:59 <int-e> That doesn't mean that it isn't worth buying... I completed almost 50 of the levels (49) and had quite a bit of fun (for maybe 40 levels...). But I don't expect to finish.
12:54:18 -!- Essadon has joined.
12:57:19 <int-e> (That last one was about Infinifactory)
13:10:06 <arseniiv> oh I found I was not complete about minimal logic literature I have
13:12:14 <arseniiv> rain1: Kripke models are discussed in another article, “Subminimal negation” by Almudena Colacito, Dick de Jongh and Ana Lucia Vargas. In times of the first article Kripke models of course didn’t exist yet
13:13:20 -!- FreeFull has joined.
13:17:32 -!- int-e has quit (Quit: leaving).
13:17:54 -!- int-e has joined.
14:24:34 -!- oerjan has joined.
14:36:31 -!- Phantom_Hoover has joined.
14:36:31 -!- Phantom_Hoover has quit (Changing host).
14:36:31 -!- Phantom_Hoover has joined.
14:37:03 <esowiki> [[Inflection]] M https://esolangs.org/w/index.php?diff=60823&oldid=60806 * Prof Apex * (-1)
14:56:25 <oerjan> it seems to me that without negation, if you have a finite number of variables then taking the conjunction of all of them will give you something that implies all other expressions in them.
14:57:04 <oerjan> which means that finite models would still have explosion in a sense.
15:51:25 <b_jonas> `perl -eprint 42*0.0254, ","
17:35:55 -!- oerjan has quit (Quit: Later).
18:12:39 <shachaf> int-e: No, what's the pun?
18:13:13 <shachaf> This game really is full of secrets.
18:20:26 -!- S_Gautam has joined.
19:02:12 -!- AnotherTest has quit (Ping timeout: 250 seconds).
19:07:27 <int-e> shachaf: Gurer vf guvf fvyyl znc anzr, "qrcguf" juvpu vf n fghcvq anzr hagvy lbh pbaarpg vg jvgu gur snpg gung vg'f "uvqqra", znxvat vg cebbs gung gur tnzr nf "uvqqra qrcguf".
19:09:36 <int-e> It's not deep, except literally.
19:10:25 <int-e> The map name after that is comparatively boring. :P
20:02:20 <zzo38> I found someone mentioned that you could convert a composite video signal into S-video by the use of a 1nF capacitor (and that in some TV sets you can somehow even get a better picture if the signal is converted in this way).
20:03:39 <shachaf> <shachaf> This game has many secrets.
20:04:12 <shachaf> Did you solve that one level in the mountaintop?
20:08:40 <int-e> shachaf: the floating one?
20:09:53 <shachaf> What about that one level in -- space, I think?
20:10:16 <shachaf> The one with the two structures where you and the rock start outside.
20:10:35 <shachaf> I made the game crash on that one.
20:10:58 <int-e> I have not done that yet (crash the game).
20:12:44 <int-e> (and maybe it's fixed now... there were many patches over the past few days.)
20:13:33 <b_jonas> shachaf: was the game crashing a feature or a bug of the game?
20:14:42 <b_jonas> ok, so there wasn't, like, an obvious "missingno is crash" rule that you had to disassemble before a missingno gets a chance to attack you
20:18:36 <FireFly> hmm, I don't think I've seen a patch for the Switch Baba is You yet
20:21:20 -!- GeekDude has joined.
20:23:25 <int-e> shachaf: If it's an overt submap of the main map, I have it. Doesn't mean I remember it :)
20:25:44 <int-e> https://int-e.eu/~bf3/tmp/baba.png <-- spoilers.
20:25:56 <int-e> (screenshot of the main map)
20:26:35 * FireFly , meanwhile, is trying to figure out Fall-C
20:27:24 <shachaf> int-e: You don't have a flower around the rocket.
20:32:23 <int-e> I was stuck on number 13 there for ages. ("Sky hold")
20:32:49 <FireFly> oh well of course as I mention it here, I realise how to solve Fall-C
20:32:58 <FireFly> essentially rubber-duck debugging
20:33:38 <int-e> Hmm how do I find a level by name :)
20:34:12 <int-e> Especially considering that it may be somewhere I haven't been yet.
20:35:22 <shachaf> Well, you've solved all of Fall, presumably.
20:35:56 <int-e> Oh, "Forest of Fall"?
20:37:12 <FireFly> Now doing Fall-D: Fetching
20:37:40 <int-e> huh, that's C here.
20:38:02 <shachaf> I think they've been shuffled by patches.
20:38:13 <FireFly> I have A: Literacy; B: Broken Playground; C: Scenic Pond; D: Fetching; E: Skeletal Door
20:38:56 <int-e> yeah here C and D are swapped
20:41:23 <int-e> Oh yes. I had to learn a new trick for Scenic Pond.
20:42:34 -!- Phantom_Hoover has quit (Remote host closed the connection).
20:42:55 <shachaf> What about Erghea Gb Scenic Pond?
20:46:50 <int-e> I suspect I don't have that yet. https://int-e.eu/~bf3/tmp/much-later.png
20:48:55 <int-e> and I've missed something in qrcguf
20:53:25 <zzo38> I looked, and, I don't know how it is work, either
21:01:22 <esowiki> [[NPFuck]] https://esolangs.org/w/index.php?diff=60824&oldid=60514 * Cortex * (+92)
21:04:40 <int-e> shachaf: I don't even know why you want a flower around the rocket
21:05:02 <int-e> spoilers, I'm sure.
21:08:05 <shachaf> I'm confused. Let me look.
21:08:31 <shachaf> I mean the moon, not the actual rocket.
21:09:21 <shachaf> But, uh, that's no the one I was thinking of. I mixed it up with Chasm.
21:09:26 <shachaf> Automated Doors was the level I got the crash on.
21:09:51 <b_jonas> are they doors with personalities like in HHGG?
21:10:05 <b_jonas> and elevators with foresight
21:13:18 <int-e> shachaf: yeah the moon has a flower :)
21:14:38 -!- arseniiv_ has joined.
21:18:00 -!- arseniiv has quit (Ping timeout: 255 seconds).
21:23:27 <int-e> shachaf: funny. but the "recent news" do mention something about an infinite loop with one of those keywords.
21:23:34 <int-e> so maybe it's fixed
21:27:10 -!- grumble has changed nick to upline.
21:43:59 <int-e> mov $2f - 1f, %rdx <-- as syntax is so confusing
21:53:14 -!- arseniiv_ has quit (Read error: Connection reset by peer).
21:53:24 -!- arseniiv has joined.
21:55:26 <zzo38> int-e: What is that code doing?
21:56:05 <int-e> zzo38: it's more readable as $(2f - 1f); 2f and 1f refer to the next (local) labels called 2 or 1.
21:56:22 <int-e> so it's computing the length of something.
22:45:37 -!- tromp has quit (Remote host closed the connection).
22:48:51 -!- oerjan has joined.
22:59:07 <oerjan> <int-e> shachaf: yeah the moon has a flower :) <-- The Little Prince reference?
23:00:16 -!- danieljabailey has joined.
23:01:27 -!- salpynx has joined.
23:03:57 <int-e> oerjan: well, now it is
23:05:51 <salpynx> kmc: I had to look up that Forth on Atari book, full pdf download available here: https://archive.org/details/ataribooks-forth-on-the-atari-learning-by-using The contents are kinda amusing too.
23:05:59 <kmc> I skimmed it
23:06:04 <kmc> they show how to hook up custom hardware, which is neat
23:09:14 <salpynx> Some of those old basic computing books have neat programs that should be fun to convert into Esolangs. The Usborne computing books from the 80s have been released to the public (with some minor conditions) here https://usborne.com/browse-books/features/computer-and-coding-books/
23:11:33 <salpynx> I have been trying to convert a 'Creepy Computer Game" from Basic to Eoderdrome, via Thue. Still a work in progress...
23:16:08 <salpynx> The base idea is to have random numbers picked by running the source (replacement rules) through shuf, and have the rest of the program run as expected. A lot of those old games are simple random number guessing game variants
23:16:34 -!- tromp has joined.
23:40:27 -!- mniip has changed nick to mnoop.