Newest at the top
| 2025-04-28 03:55:24 +0200 | bitdex | (~bitdex@gateway/tor-sasl/bitdex) (Ping timeout: 264 seconds) |
| 2025-04-28 03:55:03 +0200 | xff0x | (~xff0x@2409:251:9040:2c00:aeeb:2fa9:beb7:eb2a) (Ping timeout: 276 seconds) |
| 2025-04-28 03:48:48 +0200 | notdabs | (~Owner@2600:1700:69cf:9000:c531:a8cf:57a8:ee6f) (Quit: Leaving) |
| 2025-04-28 03:44:54 +0200 | j1n37 | (~j1n37@user/j1n37) j1n37 |
| 2025-04-28 03:44:24 +0200 | j1n37 | (~j1n37@user/j1n37) (Ping timeout: 252 seconds) |
| 2025-04-28 03:42:31 +0200 | euleritian | (~euleritia@ip4d17f82f.dynamic.kabel-deutschland.de) |
| 2025-04-28 03:42:10 +0200 | euleritian | (~euleritia@ip4d17f82f.dynamic.kabel-deutschland.de) (Read error: Connection reset by peer) |
| 2025-04-28 03:37:01 +0200 | hgolden | (~hgolden@2603:8000:9d00:3ed1:88e0:76ff:fe9c:b21e) hgolden |
| 2025-04-28 03:34:35 +0200 | hgolden | (~hgolden@2603:8000:9d00:3ed1:88e0:76ff:fe9c:b21e) (Remote host closed the connection) |
| 2025-04-28 03:33:39 +0200 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-04-28 03:33:24 +0200 | euleritian | (~euleritia@ip4d17f82f.dynamic.kabel-deutschland.de) |
| 2025-04-28 03:33:06 +0200 | euleritian | (~euleritia@dynamic-176-006-133-101.176.6.pool.telefonica.de) (Read error: Connection reset by peer) |
| 2025-04-28 03:28:53 +0200 | snoopy1 | (~Thunderbi@199.115.144.130) |
| 2025-04-28 03:22:28 +0200 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 276 seconds) |
| 2025-04-28 03:21:14 +0200 | ljdarj | (~Thunderbi@user/ljdarj) (Ping timeout: 245 seconds) |
| 2025-04-28 03:18:07 +0200 | <monochrom> | Oh hahaha |
| 2025-04-28 03:15:30 +0200 | OftenFaded9 | (~OftenFade@user/tisktisk) (Client Quit) |
| 2025-04-28 03:15:19 +0200 | bitmapper | (uid464869@id-464869.lymington.irccloud.com) (Quit: Connection closed for inactivity) |
| 2025-04-28 03:14:54 +0200 | OftenFaded | (~OftenFade@user/tisktisk) (Ping timeout: 240 seconds) |
| 2025-04-28 03:13:51 +0200 | OftenFaded9 | (~OftenFade@user/tisktisk) OftenFaded |
| 2025-04-28 03:07:21 +0200 | weary-traveler | (~user@user/user363627) user363627 |
| 2025-04-28 03:07:04 +0200 | weary-traveler | (~user@user/user363627) (Quit: Konversation terminated!) |
| 2025-04-28 03:05:52 +0200 | <int-e> | Ah yeah the good old 1988 IOCCC entry. |
| 2025-04-28 03:03:32 +0200 | <mauke> | #include "/dev/tty" // please type the correct code |
| 2025-04-28 03:02:41 +0200 | acidjnk_new | (~acidjnk@p200300d6e71c4f29a1deb7f42d1df083.dip0.t-ipconnect.de) (Ping timeout: 248 seconds) |
| 2025-04-28 03:00:51 +0200 | j1n37 | (~j1n37@user/j1n37) j1n37 |
| 2025-04-28 02:59:48 +0200 | machinedgod | (~machinedg@d108-173-18-100.abhsia.telus.net) (Ping timeout: 276 seconds) |
| 2025-04-28 02:57:40 +0200 | j1n37 | (~j1n37@user/j1n37) (Read error: Connection reset by peer) |
| 2025-04-28 02:55:26 +0200 | __jmcantrell__ | (~weechat@user/jmcantrell) (Ping timeout: 272 seconds) |
| 2025-04-28 02:54:12 +0200 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) peterbecich |
| 2025-04-28 02:51:55 +0200 | <ames> | if you don't have typecase at runtime you can just erase all the types in addition to things that are otherwise marked erased. agda does this, pretty sure coq does too |
| 2025-04-28 02:50:48 +0200 | otto_s | (~user@p4ff27ad7.dip0.t-ipconnect.de) |
| 2025-04-28 02:44:56 +0200 | <monochrom> | I guess I can cheat too. I can take it down to linear time. The program is a huge binary search tree that stores the answer for every input for a sufficiently large range. The exe will not fit in any storage in existence today, nay, any data centre, but we can talk hypothetically about how nice it would be. >:) |
| 2025-04-28 02:41:31 +0200 | otto_s | (~user@p5de2f428.dip0.t-ipconnect.de) (Ping timeout: 276 seconds) |
| 2025-04-28 02:41:22 +0200 | haritz | (~hrtz@user/haritz) haritz |
| 2025-04-28 02:41:22 +0200 | haritz | (~hrtz@152.37.68.178) (Changing host) |
| 2025-04-28 02:41:22 +0200 | haritz | (~hrtz@152.37.68.178) |
| 2025-04-28 02:40:38 +0200 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) (Remote host closed the connection) |
| 2025-04-28 02:38:13 +0200 | sim590 | (~simon@209-15-185-101.resi.cgocable.ca) |
| 2025-04-28 02:37:59 +0200 | xff0x | (~xff0x@2409:251:9040:2c00:aeeb:2fa9:beb7:eb2a) |
| 2025-04-28 02:36:55 +0200 | <monochrom> | If you require the number in question to be obtained during runtime-only from some user or entity, then the factorization must happen at run time. Do you call that unoptimized, just because the "O(1)-time static solution" exists? |
| 2025-04-28 02:36:03 +0200 | <geekosaur> | (one of whom was a CS postgrad at C-MU who replicated it after hearing about the original) |
| 2025-04-28 02:35:31 +0200 | <geekosaur> | true story and done multiple times by multiple people |
| 2025-04-28 02:34:57 +0200 | <monochrom> | Someone wrote a prime factorization algorithm in C++ that takes O(1) time. How: The factorization happened at compile time, the generated code just needs to print the answer. |
| 2025-04-28 02:34:01 +0200 | <monochrom> | You are reminding me of that joke (or true story) about C++ back then. |
| 2025-04-28 02:30:10 +0200 | <monochrom> | s/pass n and v/pass n and the vector/ |
| 2025-04-28 02:27:28 +0200 | <monochrom> | Or you can do an implicit church encoding like I described. You don't construct a pair for the sigma type, you pass n and v "separately" to a function foo :: (n::Nat) -> Vec n Bool -> IO (). |
| 2025-04-28 02:24:47 +0200 | <monochrom> | If you have n::Nat coming from user input, for example the user inputs n booleans and you store them in an index-safe vector, i.e., the vector type includes the length n, i.e., Vec n Bool, then generically speaking you now have a sigma type: v :: Σn::Nat. Vec n Bool. You can call that dynamic; it's a sigma, it's OOP now. |
| 2025-04-28 02:24:26 +0200 | <haskellbridge> | <loonycyborg> unless it'sJIT |
| 2025-04-28 02:24:22 +0200 | <haskellbridge> | <loonycyborg> because compiler doesn't know anything about actual data that will be read |