| 2025-03-30 00:08:45 +0100 | rekahsoft | (~rekahsoft@bras-base-orllon1103w-grc-19-74-12-85-11.dsl.bell.ca) (Ping timeout: 276 seconds) |
| 2025-03-30 00:15:19 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 244 seconds) |
| 2025-03-30 00:16:31 +0100 | connrs_ | (~connrs@conners.plus.com) (Remote host closed the connection) |
| 2025-03-30 00:16:39 +0100 | connrs_ | (~connrs@conners.plus.com) |
| 2025-03-30 00:17:05 +0100 | connrs | (~connrs@user/connrs) (Quit: ZNC 1.9.1 - https://znc.in) |
| 2025-03-30 00:17:05 +0100 | connrs_ | connrs |
| 2025-03-30 00:17:11 +0100 | connrs | (~connrs@conners.plus.com) (Remote host closed the connection) |
| 2025-03-30 00:17:19 +0100 | connrs | (~connrs@user/connrs) connrs |
| 2025-03-30 00:26:15 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-03-30 00:28:33 +0100 | connrs | (~connrs@user/connrs) (Remote host closed the connection) |
| 2025-03-30 00:28:41 +0100 | connrs | (~connrs@user/connrs) connrs |
| 2025-03-30 00:31:01 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 248 seconds) |
| 2025-03-30 00:35:12 +0100 | ljdarj1 | (~Thunderbi@user/ljdarj) ljdarj |
| 2025-03-30 00:35:33 +0100 | peterbecich1 | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) peterbecich |
| 2025-03-30 00:37:54 +0100 | ljdarj | (~Thunderbi@user/ljdarj) (Ping timeout: 265 seconds) |
| 2025-03-30 00:37:54 +0100 | ljdarj1 | ljdarj |
| 2025-03-30 00:38:47 +0100 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) (Ping timeout: 244 seconds) |
| 2025-03-30 00:39:06 +0100 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) peterbecich |
| 2025-03-30 00:42:04 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-03-30 00:42:24 +0100 | peterbecich1 | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) (Ping timeout: 244 seconds) |
| 2025-03-30 00:50:40 +0100 | Unicorn_Princess | (~Unicorn_P@user/Unicorn-Princess/x-3540542) Unicorn_Princess |
| 2025-03-30 00:54:45 +0100 | peterbecich1 | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) peterbecich |
| 2025-03-30 00:56:39 +0100 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) (Ping timeout: 244 seconds) |
| 2025-03-30 00:57:42 +0100 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) peterbecich |
| 2025-03-30 00:57:46 +0100 | peterbecich1 | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) (Client Quit) |
| 2025-03-30 01:02:04 +0100 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) (Ping timeout: 252 seconds) |
| 2025-03-30 01:04:24 +0100 | otto_s | (~user@p4ff27624.dip0.t-ipconnect.de) (Ping timeout: 260 seconds) |
| 2025-03-30 01:06:02 +0100 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) peterbecich |
| 2025-03-30 01:06:05 +0100 | otto_s | (~user@p5de2f2eb.dip0.t-ipconnect.de) |
| 2025-03-30 01:12:05 +0100 | <haskellbridge> | <thirdofmay18081814goya> does anyone know of an invertible coding function "Int -> Int" for a value of type "Tree Int"? i.e., translate a value "Tree Int" into a value "Int" and have a unique way to translate an "Int" back into a "Tree Int" |
| 2025-03-30 01:12:26 +0100 | <haskellbridge> | <thirdofmay18081814goya> does anyone know of an invertible coding function "Tree Int -> Int"* |
| 2025-03-30 01:13:09 +0100 | <haskellbridge> | <thirdofmay18081814goya> suppose specifically a rose tree with values "Int" |
| 2025-03-30 01:13:38 +0100 | hattckory | (~hattckory@bras-base-toroon4524w-grc-30-70-27-118-207.dsl.bell.ca) (Ping timeout: 248 seconds) |
| 2025-03-30 01:16:30 +0100 | <haskellbridge> | <dmjio> thirdofmay18081814goya did you tree "foldTree" and "unfoldTree" |
| 2025-03-30 01:16:43 +0100 | <haskellbridge> | <dmjio> * try |
| 2025-03-30 01:18:29 +0100 | <haskellbridge> | <Bowuigi> thirdofmay18081814goya I don't see how that could be total, since you have to fit many values of Int in a single one, any of which can be as large as INT_MAX |
| 2025-03-30 01:18:37 +0100 | causal | (~eric@50.35.84.231) causal |
| 2025-03-30 01:18:37 +0100 | <Leary> | thirdofmay: Impossible; |Tree Int| > |Int|. If you wanted an invertible `Tree Integer -> Integer`, then you're essentially doing de/serialisation. |
| 2025-03-30 01:20:45 +0100 | <haskellbridge> | <Bowuigi> If you ignore size concerns and want an invertible "Tree Integer -> Integer", you can get one by treating the output integer as a binary file |
| 2025-03-30 01:20:56 +0100 | <geekosaur> | gödel coding /s |
| 2025-03-30 01:21:36 +0100 | <haskellbridge> | <thirdofmay18081814goya> Leary: this is not the case, note that any element of "Tree Int" is constructible in a finite number of steps, so can be encoded by a function "Nat -> Tree Int", and therefore "Tree Int" has the same size as "Int" (since "| Int | = | Nat |") |
| 2025-03-30 01:22:57 +0100 | <haskellbridge> | <Bowuigi> Wouldn't that mean that it's possible to encode its zipper instead of the actual tree? |
| 2025-03-30 01:23:48 +0100 | tromp | (~textual@2001:1c00:3487:1b00:9865:6ec1:d353:2dc8) (Quit: My iMac has gone to sleep. ZZZzzz…) |
| 2025-03-30 01:25:30 +0100 | <haskellbridge> | <thirdofmay18081814goya> Bowuigi: yeah, am just looking for any function that can uniquely specify a tree + an ordering on "Tree Int" that we can use this function with |
| 2025-03-30 01:26:04 +0100 | <haskellbridge> | <Bowuigi> Also note that finite doesn't mean it's inside an Int's bounds |