2025/11/21

Newest at the top

2025-11-21 07:14:46 +0100trickard_(~trickard@cpe-90-98-47-163.wireline.com.au)
2025-11-21 07:14:32 +0100trickard(~trickard@cpe-90-98-47-163.wireline.com.au) (Read error: Connection reset by peer)
2025-11-21 07:12:13 +0100michalz(~michalz@185.246.207.203)
2025-11-21 07:08:49 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 250 seconds)
2025-11-21 07:04:32 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn
2025-11-21 06:55:30 +0100takuan(~takuan@d8D86B9E9.access.telenet.be)
2025-11-21 06:55:24 +0100humasect(~humasect@dyn-192-249-132-90.nexicom.net) (Quit: Leaving...)
2025-11-21 06:53:22 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 244 seconds)
2025-11-21 06:46:28 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn
2025-11-21 06:46:21 +0100humasect(~humasect@dyn-192-249-132-90.nexicom.net) humasect
2025-11-21 06:45:54 +0100haritz(~hrtz@user/haritz) (Quit: ZNC 1.8.2+deb3.1+deb12u1 - https://znc.in)
2025-11-21 06:39:40 +0100haltingsolver(~cmo@2604:3d09:207f:8000::d1dc) (Ping timeout: 264 seconds)
2025-11-21 06:37:52 +0100Square2(~Square4@user/square) (Ping timeout: 255 seconds)
2025-11-21 06:35:43 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds)
2025-11-21 06:34:40 +0100Square3(~Square@user/square) Square
2025-11-21 06:31:15 +0100weary-traveler(~user@user/user363627) user363627
2025-11-21 06:31:06 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn
2025-11-21 06:24:18 +0100 <monochrom> (Difference between by-name and macro expansion: The latter suffers variable capture issues!)
2025-11-21 06:23:19 +0100 <monochrom> (Difference between lazy and by name: lazy memoizes, by-name doesn't.)
2025-11-21 06:22:09 +0100 <monochrom> EvanR: Haha define what function application means. I like that. I propose 5 choices: call by value left-to-right, call by value right-to-left, call by need (lazy), call by name, TeX-like macro
2025-11-21 06:20:19 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 255 seconds)
2025-11-21 06:15:43 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn
2025-11-21 06:07:03 +0100vardhan(~vardhan@122.172.85.147)
2025-11-21 06:04:32 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 240 seconds)
2025-11-21 06:00:03 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn
2025-11-21 05:55:06 +0100trickard_trickard
2025-11-21 05:53:31 +0100vardhan(~vardhan@122.172.85.147) (Ping timeout: 246 seconds)
2025-11-21 05:50:36 +0100democritus(~democritu@2600:1700:ba69:10:ad1b:59dc:c894:12ec)
2025-11-21 05:49:06 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds)
2025-11-21 05:48:39 +0100Pseudonym(~Pseudonym@194-223-46-47.tpgi.com.au) (Quit: Leaving)
2025-11-21 05:44:30 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn
2025-11-21 05:40:47 +0100 <EvanR> exact real numbers, yes
2025-11-21 05:40:33 +0100 <EvanR> chromoblob, this is false for floats, and is the correct thing to do in some cases
2025-11-21 05:40:13 +0100 <EvanR> attempting to use math on a computer is a source of errors in programs. avoidance recommended
2025-11-21 05:40:04 +0100 <chromoblob> you should never test "real" numbers for equality, it's not meaningful in computers
2025-11-21 05:40:02 +0100 <jreicher> That's really interesting. I object to it on mathematically purist grounds, which I'm only half-serious about, but that actually looks like it matters.
2025-11-21 05:38:53 +0100 <fgarcia> a source of errors in programs, if software developers do not take into account that while the two zero representations behave as equal under numeric comparisons, they yield different results in some operations."
2025-11-21 05:38:51 +0100 <fgarcia> "It is claimed that the inclusion of signed zero in IEEE 754 makes it much easier to achieve numerical accuracy in some critical problems, in particular when computing with complex elementary functions. On the other hand, the concept of signed zero runs contrary to the usual assumption made in mathematics that negative zero is the same value as zero. Representations that allow negative zero can be
2025-11-21 05:38:26 +0100 <fgarcia> i think wikipedia has some writing about this
2025-11-21 05:38:09 +0100 <geekosaur> losing the "negative" switches which quadrant you're in
2025-11-21 05:38:05 +0100Pseudonym(~Pseudonym@194-223-46-47.tpgi.com.au) Pseudonym
2025-11-21 05:37:55 +0100 <EvanR> by the same logic negative NaN accomplishes the same thing
2025-11-21 05:37:54 +0100 <geekosaur> fgarcia, yes, and it happens when you're working with trig functions in a plane
2025-11-21 05:37:11 +0100 <EvanR> so you end up with partial information
2025-11-21 05:37:11 +0100 <geekosaur> as apparently has libtommath which was my first idea (then found something pointing to bsdnt instead)
2025-11-21 05:37:05 +0100werneta(~werneta@71.83.160.242) (Quit: Lost terminal)
2025-11-21 05:36:42 +0100 <EvanR> a negative zero happens when a computation would be negative but too small to represent
2025-11-21 05:36:40 +0100 <geekosaur> actually it was bsdnt, which seems to have disappeared
2025-11-21 05:34:59 +0100 <fgarcia> i am not smart. would they have thought it would be somehow useful for limits approaching from >0 and <0 ?
2025-11-21 05:34:50 +0100 <EvanR> whatever you need to do do it in the range 1 <= x < 2