00:36:20 -!- xkapastel has joined.
01:00:53 -!- arseniiv has quit (Ping timeout: 245 seconds).
01:06:36 -!- tromp has joined.
01:11:27 -!- tromp has quit (Ping timeout: 264 seconds).
01:39:00 <zzo38> "X-Clacks-Overhead is a non-standardised HTTP header..." I have seen it in NNTP too (when downloading a message from the aioe.org help desk newsgroup).
02:45:27 -!- xkapastel has quit (Quit: Connection closed for inactivity).
02:54:50 -!- tromp has joined.
02:59:13 -!- tromp has quit (Ping timeout: 250 seconds).
03:15:10 -!- diginet has joined.
03:57:49 <zzo38> I have a book of philosophy of mathematics and logic. In one chapter they mention set theory with intuitionistic logic and Uniformity Principle.
03:57:55 <zzo38> Do you know of that?
04:24:28 -!- MDude has quit (Ping timeout: 244 seconds).
04:43:23 -!- tromp has joined.
04:48:03 -!- tromp has quit (Ping timeout: 264 seconds).
04:52:21 -!- arseniiv has joined.
05:14:31 -!- MDude has joined.
05:41:54 <zzo38> Also they say that a set that is neither finite nor infinite is a "Dedekind set", but I cannot find that on Wikipedia.
05:45:48 <shachaf> What is Uniformity Principle?
05:47:10 <shachaf> Do you like identity-based encryption?
05:49:14 <zzo38> How is identity-based encryption working?
05:50:19 <zzo38> Uniformity Principle is defined as: Whenever an extensional binary relation R links every set of natural numbers X to some natural number n, there is some n that gets related to R by all such sets X.
05:50:50 <zzo38> forall X. exists n. R(X,n) -> exists n. forall X. R(X,n)
05:51:01 <shachaf> This is the description I heard:
05:51:04 <zzo38> (This is with intuitionistic logic, not classical logic.)
05:51:32 -!- sprocklem has quit (Read error: Connection reset by peer).
05:51:34 <shachaf> You can use any string as a public key and encrypt things with it, and a central authority can issue private keys that can be used to decrypt.
05:51:48 <shachaf> For example you could encrypt to a username.
05:53:30 <zzo38> I think it isn't so good probably
05:53:40 -!- arseniiv has quit (Ping timeout: 248 seconds).
05:54:35 <shachaf> I think it's pretty neat that it's possible.
06:02:03 <shachaf> Another thing you can do is "attribute-based encryption".
06:31:34 -!- tromp has joined.
06:34:21 -!- tromp has quit (Remote host closed the connection).
06:34:33 -!- tromp has joined.
06:39:34 <esowiki> [[ ]] https://esolangs.org/w/index.php?diff=65646&oldid=62052 * Dtuser1337 * (+18) Adding the year.
06:41:13 -!- sprocklem has joined.
06:45:30 <esowiki> [[Microscript]] M https://esolangs.org/w/index.php?diff=65647&oldid=45776 * Dtuser1337 * (-13) /* Commands */ seems like the <code> tag dosent work when in <pre> tag.
06:46:05 <zzo38> This defines the set of truth values as pairing propositions p with {x:x=0 and p} to make a set of sets. In conventional mathematics this is {{},{0}}, but with the kind described in this book with intuitionistic and uniformity, such a set is neither finite nor infinite.
06:46:26 -!- tromp has quit (Remote host closed the connection).
06:47:25 <zzo38> It also has, that a set being nonempty is different from a set being inhabited.
06:47:32 -!- tromp has joined.
06:48:02 <esowiki> [[Jumper]] https://esolangs.org/w/index.php?diff=65648&oldid=65161 * Dtuser1337 * (+18) Woosh
06:52:05 <esowiki> [[Jolf]] https://esolangs.org/w/index.php?diff=65649&oldid=47253 * Dtuser1337 * (+18) Yare yare daze
06:52:16 <shachaf> zzo38: Is "inhabited" just stronger than nonempty because it names a specific inhabitant?
06:52:51 <shachaf> zzo38: Do you like this? https://home.sandiego.edu/~shulman/papers/lcm-bloomington-talk.pdf
06:52:56 -!- nfd9001 has joined.
06:54:43 <zzo38> shachaf: It is stronger because it is intuitionistic logic, where (exists x. not phi) does not follow logically from (not forall x. phi).
06:55:40 <shachaf> I think those slides make a pretty compelling case for using linear logic for this sort of thing.
07:10:43 <zzo38> Does page ten have "n > n" but should it be "n > N"?
07:30:04 -!- AnotherTest has joined.
08:05:39 -!- wob_jonas has joined.
08:07:05 <wob_jonas> "<shachaf> You can use any string as a public key and encrypt things with it, and a central authority can issue private keys that can be used to decrypt." => sure. the central authority fixes an algorithm to generate a random private/public keypair with a reproducible random generator seeded with the super-secret key of the central authority plus t
08:07:36 <wob_jonas> there are only two problems: the central authority has to verify somehow who gets to own each identity, and the central authority has to make sure that the root key isn't stolen or lost.
08:17:59 <shachaf> wob_jonas: You can encrypt without asking the central authority.
08:18:10 <shachaf> The public key is just an arbitrary string.
08:18:39 <wob_jonas> can you also decrypt without asking the central authority?
08:19:05 <shachaf> You get a decryption key from them.
08:19:39 <wob_jonas> do you just encrypt everything with the central authority's public key and they decrypt the messages (or their block cypher keys at least) for you?
08:20:11 <shachaf> No, you don't need to give them the message itself.
08:21:04 <wob_jonas> sure, you only need to give the encrypted block cypher key
08:21:16 <wob_jonas> that's shorter than the message usually
08:21:32 <wob_jonas> it's of a fixed size even if the message has a whole video
08:22:14 <shachaf> They give you a single decryption key that you can use to decrypt any message that was encrypted with your name by anyone.
08:22:20 <wob_jonas> but then, how do you keep the message secret, unless there's a second layer of encryption or something? send it by snail mail?
08:22:34 <wob_jonas> shachaf: now that sounds more impossible
08:27:03 <shachaf> https://en.wikipedia.org/wiki/ID-based_encryption talks about it apparently.
08:29:19 -!- atslash has joined.
08:34:40 -!- Lord_of_Life has quit (Ping timeout: 258 seconds).
08:36:27 -!- Lord_of_Life has joined.
09:12:51 <wob_jonas> so, um, dumb question but does https://esolangs.org/wiki/Flop qualify as a Brainfuck-like?
09:14:30 <wob_jonas> it has a separate code and data memory, has a single head pointing into the data memory, can increment or decrement or zero-test the value under the data head but not much more
09:15:00 <wob_jonas> but has more general control flow than brainfuck
09:15:50 <wob_jonas> or maybe the data memory and code memory are supposed to be the same array, like in befunge
09:17:01 <wob_jonas> not easy to tell anything from the description because it has no interpreter and no nontrivial programs
11:09:09 -!- atslash has quit (Ping timeout: 258 seconds).
11:09:21 -!- atslash has joined.
11:19:08 <wob_jonas> https://www.youtube.com/channel/UCiyuYC0D4-AO0AonCfMifPQ has some nice classical music
11:29:59 <int-e> Oh what a brilliant idea... let's display ads (in the console) when installing packages. How about running a crypto miner for half an hour before allowing your package to be installed?
11:33:35 <myname> if you make ads in terminal, i want at least some animation and mouse interaction
11:35:25 <int-e> https://github.com/standard/standard/issues/1381 is the experiment in question
11:36:39 <int-e> The irony is that this really hilights a security problem.
11:37:03 <wob_jonas> display ads when installing packages => sure, installers for some commercial packages do that
11:37:16 <int-e> Maybe I should open a ticket asking how much he wants for planting a backdoor.
11:37:16 <myname> int-e: npm already has so much of those, one more or less won't matter
11:37:30 <wob_jonas> running a crypto miner for half an hour => I wouldn't exclude it, the installer also takes half a day to complete
11:37:32 <int-e> (That should be an attractive funding source!)
11:40:38 <int-e> (The source also mentions https://github.com/kethinov/no-cli-ads ... which is the corresponding ad-blocker.)
11:40:51 <int-e> (Let the games begin!)
11:43:12 <int-e> Oh well. I received a U2F token in the mail and installation was almost painless (one configuration file for udev and things worked...)
11:47:36 <myname> forken would be an interesting dick move
11:50:01 <int-e> is "forken" denglish?
11:51:08 <int-e> anyway, forking is a way to relieve the pain of the maintainer, so it is a solution to the problem as stated. (Framed properly: "I'm tired of maintaining this software for free.")
11:52:28 <myname> not maintaining, just making an adless-standard fork that automatically merges standard overnight
13:20:03 -!- arseniiv has joined.
13:31:17 -!- xkapastel has joined.
13:59:41 <esowiki> [[Flop]] https://esolangs.org/w/index.php?diff=65650&oldid=65645 * InfiniteDonuts * (+103)
14:00:17 <esowiki> [[SNUSP]] https://esolangs.org/w/index.php?diff=65651&oldid=53706 * InfiniteDonuts * (+39)
14:01:12 <esowiki> [[PATH]] https://esolangs.org/w/index.php?diff=65652&oldid=33608 * InfiniteDonuts * (+45)
14:01:40 <esowiki> [[PATH]] https://esolangs.org/w/index.php?diff=65653&oldid=65652 * InfiniteDonuts * (+9)
14:02:42 <esowiki> [[User:InfiniteDonuts]] https://esolangs.org/w/index.php?diff=65654&oldid=65625 * InfiniteDonuts * (-24)
14:06:17 -!- Melvar has quit (Quit: WeeChat 2.4).
14:49:38 -!- atslash has quit (Ping timeout: 244 seconds).
14:50:21 -!- atslash has joined.
15:02:16 <zzo38> npm has some switches to control installation, you could perhaps use --ignore-scripts to skip the ads maybe
15:03:23 <zzo38> (I don't know if it works; I haven't tried it, but if the ads are loaded in that way then it might)
15:12:25 <zzo38> (And, it seems to be, as far as I can tell. It has a "funding" package as a dependency; the "funding" package executes itself as soon as it is installed.)
15:15:54 <int-e> well that seems a bit pointless
15:16:20 <int-e> (if you don't trust the author/maintainer with their installation script, why would you trust them with their other code?
15:17:28 <zzo38> Yes, that makes sense, although it is a simple way to skip the installation scripts for whatever reason (including, that you may wish to review the code before running the scripts, or add additional steps in between, or whatever else you might want).
15:32:27 <zzo38> I think Rogers system is better than Magnuson system.
15:34:26 -!- Melvar has joined.
15:35:23 -!- Sgeo has quit (Ping timeout: 268 seconds).
15:49:33 <zzo38> "Another common way of expressing the base is writing it as a decimal subscript after the number that is being represented (this notation is used in this article)." I have also seen the base spelled out in words as the subscript, but it can be long. Also I have seen some documents use a hexadecimal subscript (in the same document with decimal subscripts!).
15:49:45 <zzo38> So, I propose to use subscripts with roman numbers instead.
15:55:02 <zzo38> What do you think of this?
16:02:34 <Hooloovo0> I would avoid roman numerals if at all possible
16:02:43 <Hooloovo0> they're really hard to use for numbers >~10
16:05:10 -!- Phantom_Hoover has joined.
16:13:29 <arseniiv> zzo38: in totally ambiguous scenarios, I’d propose writing the base in unary. Ironically, unary doesn’t belong to the family of numerations to which decimal or binary do
16:14:37 <arseniiv> though it’s not enough, I’d write all the digits too maybe (and then unary is unnecessary), like 1001011_(01)
16:14:59 <zzo38> arseniiv: That is going to be even more long than using words, I think.
16:19:39 <arseniiv> <zzo38> Also they say that a set that is neither finite nor infinite is a "Dedekind set", but I cannot find that on Wikipedia. => seems like a terminological confusion. There are several definitions of (in)finiteness of a set, varying in strength when no presuppositions like the axiom of choice are made. When the latter is present, though, Dedekind (in)finite is equivalent to “usual” (in)finite. This can be useful: https://en.wikipedia.org/wiki/Fin
16:19:39 <arseniiv> ite_set#Other_concepts_of_finiteness
16:22:03 <arseniiv> ah, this is in intuitionistic concept, then I don’t know how it relates
16:22:43 <arseniiv> <zzo38> arseniiv: That is going to be even more long than using words, I think. => agree for ten, disagree for two :)
16:23:10 <arseniiv> https://en.wikipedia.org/wiki/Finite_set#Other_concepts_of_finiteness
16:24:00 <arseniiv> hopefully it still could be useful. They couldn’t name those sets Dedekind without any connection to Dedekind finiteness
16:26:09 <zzo38> Yes, it is shorter than words in case of two, but, often you will use larger numbers for the base. If it is roman numbers then is as much as unary in case of two
16:33:22 -!- FreeFull has joined.
16:37:00 -!- b_jonas has joined.
16:53:23 <esowiki> [[Flop]] https://esolangs.org/w/index.php?diff=65655&oldid=65650 * B jonas * (+24)
16:55:53 <HackEso> olist 1177: shachaf oerjan Sgeo FireFly boily nortti b_jonas
17:49:38 -!- MDude has quit (Ping timeout: 245 seconds).
17:50:27 -!- MDude has joined.
18:12:19 <esowiki> [[Hello world program in esoteric languages]] https://esolangs.org/w/index.php?diff=65656&oldid=65643 * InfiniteDonuts * (+86)
18:17:39 <esowiki> [[Flop]] https://esolangs.org/w/index.php?diff=65657&oldid=65655 * InfiniteDonuts * (+258)
18:20:23 <esowiki> [[Flop]] https://esolangs.org/w/index.php?diff=65658&oldid=65657 * InfiniteDonuts * (+147)
18:21:23 <esowiki> [[Flop]] https://esolangs.org/w/index.php?diff=65659&oldid=65658 * InfiniteDonuts * (+6)
18:30:54 <esowiki> [[Flop]] https://esolangs.org/w/index.php?diff=65660&oldid=65659 * InfiniteDonuts * (+164)
18:32:43 <esowiki> [[Flop]] https://esolangs.org/w/index.php?diff=65661&oldid=65660 * InfiniteDonuts * (+16) /* A Brief Tutorial */
18:33:58 <esowiki> [[Flop]] https://esolangs.org/w/index.php?diff=65662&oldid=65661 * InfiniteDonuts * (-18) /* Sample Programs */
18:55:27 -!- nfd9001 has quit (Ping timeout: 245 seconds).
19:31:02 -!- xkapastel has quit (Quit: Connection closed for inactivity).
19:37:59 -!- ivzem[m] has joined.
20:11:11 <esowiki> [[Funge-98]] https://esolangs.org/w/index.php?diff=65663&oldid=59451 * Quuxplusone * (+21) documentation of 'p' had the arguments in the wrong order
20:14:47 <esowiki> [[Funge-98]] https://esolangs.org/w/index.php?diff=65664&oldid=65663 * Quuxplusone * (+36) /* Instructions */ fix description of % and / for clarity
20:21:20 <esowiki> [[Funge-98]] https://esolangs.org/w/index.php?diff=65665&oldid=65664 * Quuxplusone * (+170) /* Instructions */ add "greater", and asciibetize the table
20:31:27 -!- Phantom__Hoover has joined.
20:32:45 -!- Phantom___Hoover has joined.
20:33:04 -!- Lord_of_Life_ has joined.
20:34:38 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds).
20:35:28 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
20:35:48 -!- Phantom__Hoover has quit (Ping timeout: 244 seconds).
20:35:55 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:47:19 <esowiki> [[Flop]] https://esolangs.org/w/index.php?diff=65666&oldid=65662 * InfiniteDonuts * (-10)
21:09:58 <esowiki> [[Befunge]] https://esolangs.org/w/index.php?diff=65667&oldid=62225 * Quuxplusone * (-4692) Remove VB.NET code. Esolang isn't a source code repository for interpreters, afaik. Put that code on GitHub or something.
21:10:29 -!- omegasome has joined.
21:10:39 -!- omegasome has changed nick to hppavilion[1].
21:10:58 <hppavilion[1]> I mainly connected because: It's my first day of college!
21:11:45 <hppavilion[1]> Also, I can't get to slashnet to join #xkcd and I don't know if irc.slashnet.org is down or if it's the uni's wifi or what
21:14:16 -!- hppavilion[1] has quit (Client Quit).
21:14:38 -!- hppavilion[1] has joined.
21:18:51 <b_jonas> hi hppavilion[1]! I was wondering if we lost you, you haven't been here for months
21:19:15 -!- hppavilion[2] has joined.
21:19:37 <hppavilion[2]> You had for a while, but I think I'm gonna re-add this channel as an autojoin
21:19:46 <b_jonas> might be about a year by now
21:20:59 <hppavilion[2]> Also, I just bound hexchat to my vpn (<I'd plug a sponsor link here if I were internet-famous enough to have one>) so slashnet works
21:21:42 <hppavilion[2]> You know what's sorta crazy that I realized early this morning?
21:22:01 <hppavilion[2]> If I were born a few decades ago, today would could the first time in my life I'd have internet access.
21:22:32 -!- hppavilion[1] has quit (Ping timeout: 245 seconds).
21:22:41 <HackEso> Any regular who gives the slightest Rogue One spoiler shall be hunted down in real life and have their intestines removed through their eye sockets. Members would not be exempt if they existed, which they don't.
21:22:57 <b_jonas> hppavilion[2]: ^ I wanted to ask if that's still true
21:23:20 <hppavilion[2]> b_jonas: It isn't, but the spoiler rule DOES apply to other movies
21:23:48 <hppavilion[2]> I *may* have contemplated hiring a hitman on that NFL player who tweeted out an Endgame spoiler.
21:24:42 -!- Camto[m] has joined.
21:26:00 <shachaf> Does it apply to The Empire Strikes Back?
21:27:58 <b_jonas> movies only? does it apply to tv series, webcomics, novels, short stories?
21:30:04 -!- AnotherTest has quit (Ping timeout: 272 seconds).
21:34:25 -!- nfd9001 has joined.
21:34:37 -!- atslash has quit (Ping timeout: 245 seconds).
21:37:40 -!- atslash has joined.
21:39:02 <b_jonas> I think we should rearrange the wisdoms then if Rogue One isn't particularly the target
21:41:13 <b_jonas> ``` set -e; slashlearn "spoiler//Don't give movie spoilers on channel. If you do, hppavilion may hire a hitman to hunt you down in real life and torture you in refined ways."; forget rogue one
21:41:16 <HackEso> rm: cannot remove 'wisdom/rogue': No such file or directory \ rm: cannot remove 'wisdom/one': No such file or directory \ Learned 'spoiler': Don't give movie spoilers on channel. If you do, hppavilion may hire a hitman to hunt you down in real life and torture you in refined ways.
21:41:22 <b_jonas> ``` set -e; slashlearn "spoiler//Don't give movie spoilers on channel. If you do, hppavilion may hire a hitman to hunt you down in real life and torture you in refined ways."; forget "rogue one"
21:41:24 <HackEso> Relearned 'spoiler': Don't give movie spoilers on channel. If you do, hppavilion may hire a hitman to hunt you down in real life and torture you in refined ways.Forget what?
21:41:28 <HackEso> Don't give movie spoilers on channel. If you do, hppavilion may hire a hitman to hunt you down in real life and torture you in refined ways.
21:41:42 <HackEso> hppavilion is the generator including, but not limited to, hppavilion[1], hppavilion[2], and hppavilion[42]. hppavilion is of length 37-42i-28j+4k-28ij+38ik+62jk+20ijk. A common alternative definition is the set of all items yielded by the general case of the generator. Not to be confused with hppavilion^k or hppavilion_m.
21:42:13 <HackEso> higgledy piggledy / hp pavilion / doesn't like jokes that are / written in text; // uncontroversially, / one in a million is / roughly the chance they won't / be left perplexed
21:42:14 <HackEso> hppavilion[1] se describe en las notas al pie. ¿Porqué no los dos? Nadie lo sabe. No es tan cluecless. Él aspira a ser más incomprensible que esta sabiduría.
21:42:41 <shachaf> Is that supposed to be a quaternion?
21:43:18 <b_jonas> should we mention that he hates movie spoilers in one of those?
21:44:41 <b_jonas> ``` perl -pi -e's"(jokes)"movie spoilers or $1"' wisdom/hppavilion1
21:47:02 <shachaf> What kind of higgledy piggledy is that?
21:47:08 <HackEso> 9631:2016-11-06 <oerjän> learn_append hppavilion[1] \xc3\x89l aspira a ser m\xc3\xa1s incomprensible que esta sabidur\xc3\xada. \ 8609:2016-06-26 <boil̈y> learn_append hppavilion[1] No es tan cluecless. \ 6238:2015-11-23 <oerjän> undo 6237 \ 6237:2015-11-22 <quintopïa> le/rn hppavilion[1]/HP pays $3.5m a year to name an arena in San Jose after him. \ 5917:2015-08-22 <boil̈y> learn hppavilion[1] se describe en las notas al pie. \xc2\xbfPorqu\xc3\xa9
21:47:23 <HackEso> 11916:2019-08-26 <b_jonäs> `` perl -pi -e\'s"(jokes)"movie spoilers or $1"\' wisdom/hppavilion1 \ 5743:2015-06-25 <hppavilion̈1> revert \ 5742:2015-06-25 <ZomieChenëy> learn hppavilion1 is ZombieCheney \ 5607:2015-06-18 <shachäf> ` sed -i -e \'s/\\w\\+ \\w\\+ //\' -e \'s/leave them/be left/\' wisdom/hppavilion1 \ 5606:2015-06-18 <hppavilion̈1> learn hppavilion1 is higgledy piggledy / hp pavilion / doesn\'t like jokes that are / written in text; //
21:47:57 <HackEso> higgledy piggledy / hp pavilion / doesn't like movie spoilers or jokes that are / written in text; // uncontroversially, / one in a million is / roughly the chance they won't / be left perplexed
21:49:38 <hppavilion[2]> shachaf: And re. ESB: While the tides of battle in the Great Spoiler War have clearly let lay that sufficiently old movies are fair game, I sometimes lay awake at night, fondly picturing a world where even the ending of Citizen Kane is protected for future generations
21:51:49 <shachaf> if a movie can be spoiled with a single sentence it probably isn't a good movie hth
22:09:13 -!- nfd9001 has quit (Ping timeout: 276 seconds).
22:12:33 -!- hppavilion[2] has quit (Ping timeout: 245 seconds).
22:16:46 -!- nfd9001 has joined.
22:22:52 -!- nfd9001 has quit (Ping timeout: 276 seconds).
22:26:36 -!- nfd9001 has joined.
22:37:10 -!- nfd9001 has quit (Ping timeout: 276 seconds).
22:43:21 -!- Sgeo has joined.
22:45:56 -!- arseniiv has quit (Ping timeout: 248 seconds).
22:49:13 -!- atslash has quit (Ping timeout: 245 seconds).
22:49:37 -!- atslash has joined.
22:55:29 -!- FreeFull has quit.
23:21:35 -!- Phantom___Hoover has quit (Ping timeout: 268 seconds).
23:28:37 <kmc> shachaf: I can think of some really good movies that have a big exciting twist, but I'm not sure it really spoils enjoyment of the movie to know what's coming
23:28:45 <kmc> I think people have studied it and concluded it usually doesn't
23:30:12 <shachaf> I think my statement was probably too strong, depending on what you mean by "spoil"
23:43:34 -!- b_jonas has quit (Quit: leaving).