Newest at the top
| 2026-01-16 02:32:08 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 244 seconds) |
| 2026-01-16 02:27:43 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2026-01-16 02:25:05 +0100 | divlamir | (~divlamir@user/divlamir) divlamir |
| 2026-01-16 02:24:42 +0100 | divlamir | (~divlamir@user/divlamir) (Read error: Connection reset by peer) |
| 2026-01-16 02:16:31 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 240 seconds) |
| 2026-01-16 02:11:56 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2026-01-16 02:11:45 +0100 | Zemy | (~Zemy@2600:100c:b0a0:7e6f:e8ca:c9ff:fea3:b5f7) (Ping timeout: 252 seconds) |
| 2026-01-16 02:10:25 +0100 | gmg | (~user@user/gehmehgeh) gehmehgeh |
| 2026-01-16 02:10:09 +0100 | ChaiTRex | (~ChaiTRex@user/chaitrex) ChaiTRex |
| 2026-01-16 02:09:45 +0100 | ChaiTRex | (~ChaiTRex@user/chaitrex) (Remote host closed the connection) |
| 2026-01-16 02:09:44 +0100 | gmg | (~user@user/gehmehgeh) (Remote host closed the connection) |
| 2026-01-16 02:07:45 +0100 | Zemy_ | (~Zemy@72.178.108.235) |
| 2026-01-16 02:07:09 +0100 | Zemy | (~Zemy@2600:100c:b0a0:7e6f:e8ca:c9ff:fea3:b5f7) |
| 2026-01-16 02:06:59 +0100 | Zemy | (~Zemy@72.178.108.235) (Read error: Connection reset by peer) |
| 2026-01-16 02:02:51 +0100 | <dolio> | Like, `unsafeInterleaveIO` lets you access a bit stream that has no corresponding Haskell term. |
| 2026-01-16 02:01:55 +0100 | <dolio> | It can even be useful within a computing system. |
| 2026-01-16 02:01:26 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 256 seconds) |
| 2026-01-16 01:58:41 +0100 | <dolio> | Like, you can model the bits coming in from your ethernet cable as an 'uncomputable' bit stream, because it is an external entity not subject to your computational model. But you can computably act on the stream. |
| 2026-01-16 01:57:28 +0100 | <dolio> | Not because there are 'really' uncomputable bit streams, but because a stream being uncomputable and you not knowing exactly how to compute it (because it doesn't come from some particular definition) act in sort of the same way. |
| 2026-01-16 01:56:09 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2026-01-16 01:54:52 +0100 | <dolio> | That can be a useful perspective. |
| 2026-01-16 01:54:29 +0100 | <dolio> | Oh, maybe I should mention. You can set things up differently so that there are are uncomputable bit strings to talk about. And you can identify the computable bit strings as a subset, but is still uncountable. |
| 2026-01-16 01:53:28 +0100 | <jreicher> | I didn't even know about that channel |
| 2026-01-16 01:48:33 +0100 | <geekosaur> | yeh, I've only been peeking in occasionally since I'm busy this afternoon/evening |
| 2026-01-16 01:48:19 +0100 | xff0x | (~xff0x@2405:6580:b080:900:5f60:7a2f:94c6:623e) (Ping timeout: 244 seconds) |
| 2026-01-16 01:47:04 +0100 | <monochrom> | But OK! Kicking people into the deep end feels good haha. |
| 2026-01-16 01:46:41 +0100 | <monochrom> | But I think we're done. :) |
| 2026-01-16 01:46:07 +0100 | <geekosaur> | I really should start kicking those things into #haskell-in-depth |
| 2026-01-16 01:45:37 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds) |
| 2026-01-16 01:45:23 +0100 | newmind | (~newmind@91-133-90-252.dyn.cablelink.at) |
| 2026-01-16 01:40:25 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2026-01-16 01:32:56 +0100 | Tuplanolla | (~Tuplanoll@88-114-88-95.elisa-laajakaista.fi) (Quit: Leaving.) |
| 2026-01-16 01:30:01 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds) |
| 2026-01-16 01:29:26 +0100 | <monochrom> | haha |
| 2026-01-16 01:29:18 +0100 | <TMA> | monochrom: good idea, I'll go to bed instead |
| 2026-01-16 01:27:25 +0100 | <monochrom> | TMA: Please don't go there :( >:) |
| 2026-01-16 01:26:53 +0100 | <monochrom> | "my car can do 0 to infinity in 60 seconds" >:) |
| 2026-01-16 01:26:43 +0100 | <TMA> | monochrom: you can still have uncomputable subsets of unary strings though |
| 2026-01-16 01:25:28 +0100 | DetourNe- | DetourNetworkUK |
| 2026-01-16 01:24:43 +0100 | <EvanR> | monochrom, the zero, infinity, ... rule |
| 2026-01-16 01:24:37 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2026-01-16 01:23:59 +0100 | <EvanR> | I'm good |
| 2026-01-16 01:23:51 +0100 | <jreicher> | Umm, that's philosophical turf on which I'm very comfortable arguing, but that would be even more off-topic than we already have been. Can still go there if you want. |
| 2026-01-16 01:23:40 +0100 | <int-e> | EvanR: Now that's different. Clearly chess was designed to make me lose! |
| 2026-01-16 01:23:31 +0100 | DetourNetworkUK | (DetourNetw@user/DetourNetworkUK) (Read error: Connection reset by peer) |
| 2026-01-16 01:23:16 +0100 | <EvanR> | and is valid |
| 2026-01-16 01:23:14 +0100 | <EvanR> | the game in which you lost nonetheless exists |
| 2026-01-16 01:23:12 +0100 | <monochrom> | Shannon's definition of "information" implies that {0} has 0 bits of information, {0,1} has 1 bit of information. That is already a kind of "everything is different" if you look at the ratio: from 0 to 1 is an infinite percent increase. To a large extent the whole conversation above follows. |
| 2026-01-16 01:23:11 +0100 | DetourNe- | (~DetourNet@user/DetourNetworkUK) DetourNetworkUK |
| 2026-01-16 01:23:01 +0100 | <jreicher> | Then it arguably doesn't satisfy its goal |