2026/06/24

Newest at the top

2026-06-24 03:27:54 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 246 seconds)
2026-06-24 03:24:50 +0000rekahsoft(~rekahsoft@70.51.99.119) (Remote host closed the connection)
2026-06-24 03:24:13 +0000kimiamania(~768865ec@user/kimiamania) kimiamania
2026-06-24 03:23:22 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-06-24 03:20:50 +0000vanishingideal(~vanishing@user/vanishingideal) (Ping timeout: 244 seconds)
2026-06-24 03:12:37 +0000fgarcia(~lei@user/fgarcia) fgarcia
2026-06-24 03:12:24 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 245 seconds)
2026-06-24 03:11:38 +0000smalltalkman(uid545680@id-545680.hampstead.irccloud.com) smalltalkman
2026-06-24 03:07:59 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-06-24 03:06:58 +0000kimiamania(~768865ec@user/kimiamania) (Ping timeout: 248 seconds)
2026-06-24 03:02:11 +0000 <monochrom> Yeah.
2026-06-24 03:02:00 +0000 <EvanR> as you sit there waiting for the search to terminate, you might start to feel like you're looking at the "proof" that the turing machine is infinite
2026-06-24 03:01:25 +0000 <EvanR> yes the realization of this principle is... the purported n can't not exist, so just start looping through them all in order until you find it
2026-06-24 02:59:54 +0000 <monochrom> Oh, decidable f makes the principle much less powerful. I mean much more realistic and closer to being constructive!
2026-06-24 02:57:18 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 265 seconds)
2026-06-24 02:52:54 +0000foul_owl(~kerry@94.156.149.95) (Ping timeout: 252 seconds)
2026-06-24 02:52:35 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-06-24 02:52:06 +0000Katarushisu69Katarushisu6
2026-06-24 02:52:06 +0000Katarushisu6(~Katarushi@finc-20-b2-v4wan-169598-cust1799.vm7.cable.virginm.net) (Ping timeout: 252 seconds)
2026-06-24 02:49:46 +0000Katarushisu69(~Katarushi@finc-20-b2-v4wan-169598-cust1799.vm7.cable.virginm.net)
2026-06-24 02:46:24 +0000poscat(~poscat@user/poscat) (Ping timeout: 268 seconds)
2026-06-24 02:44:28 +0000poscat0x04(~poscat@user/poscat) poscat
2026-06-24 02:41:43 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 249 seconds)
2026-06-24 02:37:56 +0000machinedgod(~machinedg@d108-173-95-19.abhsia.telus.net) (Ping timeout: 252 seconds)
2026-06-24 02:37:15 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-06-24 02:34:14 +0000oats(~oats@user/oats) oats
2026-06-24 02:33:59 +0000oats(~oats@user/oats) (Read error: Connection reset by peer)
2026-06-24 02:32:24 +0000EvanR(~EvanR@user/evanr) EvanR
2026-06-24 02:32:21 +0000td_(~td@i53870930.versanet.de)
2026-06-24 02:32:05 +0000EvanR(~EvanR@user/evanr) (Remote host closed the connection)
2026-06-24 02:30:47 +0000td_(~td@i53870911.versanet.de) (Ping timeout: 252 seconds)
2026-06-24 02:28:12 +0000 <EvanR> proposition on naturals
2026-06-24 02:27:44 +0000 <EvanR> *decidable f
2026-06-24 02:25:46 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 245 seconds)
2026-06-24 02:19:12 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-06-24 02:08:14 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds)
2026-06-24 02:03:49 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-06-24 02:03:46 +0000td_(~td@i53870911.versanet.de)
2026-06-24 02:03:44 +0000Flow(~none@gentoo/developer/flow) flow
2026-06-24 02:01:59 +0000td_(~td@i53870934.versanet.de) (Ping timeout: 245 seconds)
2026-06-24 02:01:44 +0000schuelermine(~Thunderbi@user/schuelermine) (Ping timeout: 256 seconds)
2026-06-24 02:00:18 +0000Flow(~none@gentoo/developer/flow) (Quit: WeeChat 4.7.2)
2026-06-24 01:53:09 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 257 seconds)
2026-06-24 01:52:24 +0000 <jreicher> :)
2026-06-24 01:51:43 +0000xff0x(~xff0x@fsb6a9491c.tkyc517.ap.nuro.jp)
2026-06-24 01:48:26 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-06-24 01:48:16 +0000 <monochrom> Yeah how to visualize 6 dimensions? Visualize n dimensions, then set n=6. >:)
2026-06-24 01:47:20 +0000 <EvanR> that was a joke in analogy to solve the problem for all n then set n = 2
2026-06-24 01:46:55 +0000 <jreicher> EvanR: I don't think anybody said "solve for complexity" in the general case
2026-06-24 01:46:38 +0000 <EvanR> for any function on naturals f, if there not existing an n such that f(n)=0 would be a contradiction, then there's some n where f(n) = 0