←2020-10-13 2020-10-14 2020-10-15→ ↑2020 ↑all
00:37:22 <zzo38> I host stuff on my home computer too, but I don't have version 6 internet.
00:50:47 <b_jonas> "version 6 internet" sounds weird, even if I know that the unixy socket interface calls the required address family AF_INET6
02:53:05 -!- arseniiv has joined.
02:53:30 <arseniiv> hi again world
02:57:22 -!- adu has joined.
03:12:13 <imode> hi arseniiv.
03:12:57 <arseniiv> imode: morning! (from my perspective at least)
03:13:44 <arseniiv> btw at any rate, do you know something about golden base type numerations?
03:16:15 <imode> I do not!
03:16:24 <imode> am interested in what that means though.
03:19:02 <arseniiv> ah, I was rambling about that a small amount the other day at https://esolangs.org/logs/2020-10-13.html#lnb
03:19:02 <arseniiv> I’m in a sense desperate, though I uncovered another bit between dreams. Maybe these *are* just plain non-integer base systems, but as one has identities such as φ² = φ + 1, or χ² = 2χ + 1, or (√2)² = 2, it makes an obvious way to constrain digit strings precisely in such a way to make the numeration ascending
03:19:12 <arseniiv> but I still think there’s more to it
03:21:30 <arseniiv> for example I can’t explain that easily that the restriction to have the last digit ≠ 1 (so, exactly zero) for base φ or ≠ 2 for base χ corresponds to the analogous restriction for base Fibonacci or base Pell
03:22:36 <arseniiv> oh wait, there’s no such restriction for base φ but there is for base χ
03:22:48 <arseniiv> that makes things more confusing
03:23:29 <arseniiv> (I defined χ := √2 + 1 for convenience)
03:24:36 <arseniiv> (the next one would be ψ: ψ² = 3ψ + 1, and maybe I should investigate it and find out that things are even more confusing)
03:31:16 -!- b_jonas has quit (Remote host closed the connection).
03:34:45 -!- sprocklem has quit (Ping timeout: 240 seconds).
03:35:02 -!- sprocklem has joined.
03:59:17 -!- MDude has quit (Quit: Going offline, see ya! (www.adiirc.com)).
04:52:50 <esowiki> [[Special:Log/delete]] delete * Ais523 * deleted "[[Template:Delete]]": Copyright violation: content was: "{{Ambox | namespace = main | text = '''This page is a candidate for deletion.''' | style = border: 1px solid #c23446; border-...", and the only contributor was "[[Special:Contributions/Pipythonmc|Pipythonmc]]" ([[User talk:Pipythonmc|talk]])
04:54:10 <esowiki> [[Special:Log/delete]] delete * Ais523 * deleted "[[Template:Ambox]]": Copyright violation: the only contributor was "[[Special:Contributions/Pipythonmc|Pipythonmc]]" ([[User talk:Pipythonmc|talk]])
04:54:38 <esowiki> [[Special:Log/delete]] delete * Ais523 * deleted "[[Template:AltDelete]]": Copyright violation: the only contributor was "[[Special:Contributions/Pipythonmc|Pipythonmc]]" ([[User talk:Pipythonmc|talk]])
06:16:12 <imode> https://repl.it/repls/ShorttermHumbleCommunication and now to try to bootstrap church numerals in this thing.
06:45:13 -!- sprocklem has quit (Ping timeout: 260 seconds).
07:00:37 -!- adu has quit (Quit: adu).
07:02:09 -!- imode1 has joined.
07:02:52 -!- imode has quit (Ping timeout: 272 seconds).
07:06:41 -!- imode has joined.
07:06:49 -!- imode1 has quit (Ping timeout: 260 seconds).
07:09:36 -!- cpressey has joined.
07:19:57 -!- cpressey has quit (Quit: WeeChat 1.9.1).
07:23:08 -!- Sgeo has quit (Read error: Connection reset by peer).
07:32:18 <imode> church numerals seem easy. just a bunch of compositions over and over again. could have a `number` macro that preserves the two quotations you worked with for later.
07:33:31 -!- delta23 has quit (Remote host closed the connection).
07:57:18 -!- cpressey has joined.
08:07:42 -!- hendursaga has quit (Remote host closed the connection).
08:08:28 -!- hendursaga has joined.
08:12:51 -!- hendursa1 has joined.
08:16:03 -!- hendursaga has quit (Ping timeout: 240 seconds).
08:25:05 -!- LKoen has joined.
08:35:06 -!- rain1 has quit (Quit: Leaving).
09:03:21 <esowiki> [[Stax]] https://esolangs.org/w/index.php?diff=77982&oldid=76776 * JonoCode9374 * (+104)
09:03:30 -!- rain1 has joined.
09:30:02 <cpressey> https://en.wikipedia.org/wiki/Richardson%27s_theorem
09:31:08 <cpressey> Laczkovich's simplified version looks particularly nice
09:31:22 <Taneb> Yesterday I was messing around in Haskell, and implemented regular expressions with "data Regex c a = Regex (Maybe a) (c -> Regex c a)"
09:31:44 <Taneb> I noticed it's possible to implement a Choice instance (from the profunctors library) for this type
09:33:00 <Taneb> I don't know what use this instance would have, however
09:33:47 <Taneb> Here is my code: https://gist.github.com/Taneb/804c57c4563645d933d215470cf3f911
09:38:03 <cpressey> The profunctor docs tell me Choice is "the generalization of Costar of Functor that is strong with respect to Either." I think I'll sit this one out.
09:41:23 <Taneb> cpressey: if I have a regular expression on alphabet c, I can turn it into one on Either c d, which accepts any Right value and otherwise matches what we started with if we ignore the Rights
09:45:26 <cpressey> Taneb: I don't think I follow you. What did we start with?
09:45:53 <Taneb> A regular expression on alphabet c
09:47:10 <cpressey> This is the "what we started with" in the phrase "otherwise matches what we started with"?
09:47:20 <Taneb> Yeah
09:47:48 <Taneb> So left' a*b accepts [Right x, Left a, Left a, Right y, Left b]
09:47:59 <Taneb> Because if we ignore the Rights, we hae aab which a*b accepts
09:50:29 <Taneb> Does this help?
09:51:52 <Taneb> cpressey: also feel free to look at/comment on the rest of the file, too
09:53:23 <cpressey> Is this much or any different from https://hackage.haskell.org/package/base- ?
09:54:32 <Taneb> ...somewhat
10:38:36 -!- cpressey has quit (Quit: WeeChat 1.9.1).
10:49:24 -!- imode has quit (Ping timeout: 256 seconds).
11:09:38 -!- FreeFull has joined.
11:37:45 -!- t20kdc has joined.
12:42:27 -!- hendursa1 has quit (Quit: hendursa1).
12:42:43 -!- hendursaga has joined.
13:53:39 -!- Sgeo has joined.
14:51:11 -!- aaaaaa has joined.
14:57:46 -!- MDude has joined.
15:26:02 -!- b_jonas has joined.
16:56:11 -!- Robdgreat has left.
16:56:24 -!- Arcorann_ has quit (Read error: Connection reset by peer).
17:02:28 -!- imode has joined.
17:29:44 <arseniiv> suppose we have a function `unconst :: (a → b) → Maybe b` which returns `Just x` precisely on functions extensionally equal to `const x`. How many miracles could we make? I suppose we could solve halting problem?
17:31:00 <arseniiv> for this kind of function to be reasonable, it need constraints like (Bounded a, Eq b) or something less strong than Bounded but which means “b is finite and recursively enumerable”
18:58:55 -!- dingwat has joined.
18:59:30 -!- LKoen has quit (Quit: “It’s only logical. First you learn to talk, then you learn to think. Too bad it’s not the other way round.”).
19:02:34 -!- arseniiv has quit (Ping timeout: 260 seconds).
19:28:19 -!- sprocklem has joined.
20:33:43 -!- MDude has quit (Quit: Going offline, see ya! (www.adiirc.com)).
20:42:51 -!- deltaepsilon23 has joined.
20:43:00 -!- deltaepsilon23 has changed nick to delta23.
20:58:23 -!- delta23 has quit (Quit: Leaving).
21:51:54 -!- FreeFull has quit (Read error: Connection reset by peer).
22:11:35 -!- j4cbo has quit (Ping timeout: 272 seconds).
22:12:40 -!- relrod has quit (Excess Flood).
22:12:47 -!- relrod has joined.
22:12:50 -!- relrod has quit (Changing host).
22:12:50 -!- relrod has joined.
22:13:51 -!- j4cbo has joined.
22:29:56 -!- FreeFull has joined.
22:56:19 -!- Arcorann_ has joined.
23:01:09 -!- Arcorann_ has quit (Ping timeout: 260 seconds).
23:02:18 -!- aaaaaa has quit (Quit: leaving).
23:22:53 -!- Arcorann has joined.
23:36:50 <esowiki> [[Interstack]] M https://esolangs.org/w/index.php?diff=77983&oldid=77671 * PythonshellDebugwindow * (+3) /* Cat program */ Fix cat program to match description
23:54:39 -!- FreeFull has quit.
23:55:50 -!- stux has joined.
←2020-10-13 2020-10-14 2020-10-15→ ↑2020 ↑all