Newest at the top
2025-08-28 13:27:19 +0200 | <kuribas> | The cell analogy for OOP shows this clearly, a cell is a super complicated things, maybe even more than your whole computer. |
2025-08-28 13:26:10 +0200 | Lord_of_Life | (~Lord@user/lord-of-life/x-2819915) (Ping timeout: 245 seconds) |
2025-08-28 13:26:04 +0200 | <kuribas> | Using OO for numbers is ridiculous IMO, why send a message to add two numbers. |
2025-08-28 13:26:01 +0200 | <Lycurgus> | my feels are that proving church's thesis is like proving there's no god |
2025-08-28 13:25:46 +0200 | <kuribas> | OO or actor model are good for large scale parts, where each part is self contained, and communicates with messaging. |
2025-08-28 13:22:55 +0200 | <Leary> | 'Conjecture' suggests that it's considered likely to hold. I would just call it an open question. |
2025-08-28 13:22:38 +0200 | <jreicher> | Yes, it's a conjecture. It's liable to formal proof, disproof, or independence. |
2025-08-28 13:20:10 +0200 | humasect | (~humasect@dyn-192-249-132-90.nexicom.net) |
2025-08-28 13:20:04 +0200 | <Lycurgus> | *do you |
2025-08-28 13:19:57 +0200 | <Lycurgus> | so what to you call P = NP, a conjecture? |
2025-08-28 13:19:26 +0200 | <jreicher> | Church's thesis can't be proven. That's why it's a thesis. :) |
2025-08-28 13:18:49 +0200 | <Lycurgus> | *opinion |
2025-08-28 13:17:09 +0200 | <Lycurgus> | having a considered opition is enough for a humble doer like myself |
2025-08-28 13:17:04 +0200 | califax | (~califax@user/califx) califx |
2025-08-28 13:16:47 +0200 | <Lycurgus> | well it's a matter of abstract principle, i have no interest in setting off on a proof of stuff like that or say church's thesis |
2025-08-28 13:15:50 +0200 | califax | (~califax@user/califx) (Remote host closed the connection) |
2025-08-28 13:15:26 +0200 | <jreicher> | You might want to check the difference between constructive and non-constructive proofs before you get comfortable with that |
2025-08-28 13:14:33 +0200 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 260 seconds) |
2025-08-28 13:13:45 +0200 | <Lycurgus> | i guess i'm feeling that P is prolly = NP, intuitively, verification being semantically close to computation of a value, and i sense a vested job security interest in the opposite position |
2025-08-28 13:07:49 +0200 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
2025-08-28 13:06:09 +0200 | <ski> | (delaying substitutions for variables, in the body of the delayed computation, by bundling that body with the mapping, the substitution/environment. in the case of object-orientation, that environment is known as "instance state") |
2025-08-28 13:06:00 +0200 | <Franciman> | if P = NP, life would be brutal |
2025-08-28 13:05:14 +0200 | <Franciman> | 30 years of research and implementation bottled by a interpreter done in 2 hours |
2025-08-28 13:04:56 +0200 | fp | (~Thunderbi@2001:708:150:10::72df) fp |
2025-08-28 13:04:51 +0200 | <ski> | yes. aka an implementation strategy for a delayed computation |
2025-08-28 13:04:51 +0200 | <Franciman> | how much fun did i have when i implemented fully lazy sharing and obtained a 20x increase in speed from ghc's compiled output |
2025-08-28 13:03:42 +0200 | <jreicher> | ski: A closure is not a delayed computation. It's a solution to the upward funarg problem if you optimise the substitution rule for beta reduction by using an environment. |
2025-08-28 13:02:12 +0200 | caconym747 | (~caconym@user/caconym) caconym |
2025-08-28 13:01:50 +0200 | <sajenim> | in relation to academia |
2025-08-28 13:01:44 +0200 | fp | (~Thunderbi@wireless-86-50-141-108.open.aalto.fi) (Ping timeout: 260 seconds) |
2025-08-28 13:01:38 +0200 | <sajenim> | i did read something along the lines of what you are saying |
2025-08-28 13:01:15 +0200 | <probie> | sajenim: You don't need to write good code for a PhD; the quality of code written doesn't directly map to quality of the research, and there's often less incentive to have things maintainable |
2025-08-28 13:00:04 +0200 | caconym747 | (~caconym@user/caconym) (Quit: bye) |
2025-08-28 12:59:58 +0200 | <sajenim> | my peers called me a bad coder because i mentioned it's frustrating reading his wall of text |
2025-08-28 12:59:46 +0200 | marinelli | (~weechat@gateway/tor-sasl/marinelli) (Quit: marinelli) |
2025-08-28 12:59:00 +0200 | takuan | (~takuan@d8D86B9E9.access.telenet.be) (Remote host closed the connection) |
2025-08-28 12:58:59 +0200 | lortabac | (~lortabac@2a01:e0a:541:b8f0:55ab:e185:7f81:54a4) |
2025-08-28 12:58:58 +0200 | jreicher | (~user@user/jreicher) jreicher |
2025-08-28 12:58:53 +0200 | <ski> | too long lines tend to be hard to read (hard to quickly see where the next line starts), also in prose text |
2025-08-28 12:58:16 +0200 | <sajenim> | i have 1440p aswell, but like what about multiple files open |
2025-08-28 12:58:14 +0200 | <Lycurgus> | concision freak maybe |
2025-08-28 12:57:52 +0200 | <ski> | i guess he has a high resolution screen, sajenim |
2025-08-28 12:56:57 +0200 | <Lycurgus> | so it's not surprising it took a while for the defacto thing outta PCL to become what ppl call CLOS now |
2025-08-28 12:56:49 +0200 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 248 seconds) |
2025-08-28 12:56:44 +0200 | <sajenim> | he turns everything into a 160 column 1 liner |
2025-08-28 12:56:38 +0200 | tromp | (~textual@2001:1c00:3487:1b00:6941:8da5:79d5:ac1b) (Quit: My iMac has gone to sleep. ZZZzzz…) |
2025-08-28 12:56:07 +0200 | <Lycurgus> | *apotheosis |
2025-08-28 12:56:00 +0200 | <sajenim> | idk how my prof has a phd his code stinks |
2025-08-28 12:55:55 +0200 | <Lycurgus> | well CLOS is just the aptheosis of OOP as u'd expect for the lang |
2025-08-28 12:55:44 +0200 | <ski> | i feel your pain, sajenim |