/top/
/new/
/best/
/ask/
/show/
/job/
^
slacker news
login
about
←back to thread
New proof dramatically compresses space needed for computation
(www.scientificamerican.com)
190 points
baruchel
| 1 comments |
27 Jun 25 13:59 UTC
|
HN request time: 0.205s
|
source
Show context
bluenose69
◴[
30 Jun 25 12:41 UTC
]
No.
44422559
[source]
▶
>>44396867 (OP)
#
Here's a quote from the SciAm article: "Technically, that equation was t/log(t), but for the numbers involved log(t) is typically negligibly small."
Huh?
replies(3):
>>44423934
#
>>44424629
#
>>44424701
#
1.
asimpletune
◴[
30 Jun 25 15:47 UTC
]
No.
44424701
[source]
▶
>>44422559
#
I think this means that while Log grows to infinity, it does that so slowly that it can often be treated as if it were a coefficient. Coefficients are ignored in big O notation, hence the negligibly small comment.
ID:
GO
↑