All logs are asymptotically equivalent, for the same reason that a factor of 10 ... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		thaumasiotes on Sept 23, 2023 \| parent \| context \| favorite \| on: Chez Scheme: Lisp with native code speed All logs are asymptotically equivalent, for the same reason that a factor of 10 is invisible.

loumf on Sept 23, 2023 | [–]

Hickey has made the point that in real world (not asymptomatic) uses, the constants and depths make a difference he cares about. 10x takes seconds to a minute.

freshhawk on Sept 30, 2023 | [–]

Only in theory, with branching factors of 32, they are not remotely equivalent unless you have a supercomputer counting atoms in a universe or something.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact