How far does this analogy go? For example, if I plot how long both programs take... | Hacker News

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

		dilippkumar on May 25, 2023 \| parent \| context \| favorite \| on: UCLA computer grad constructs “crown jewel of cryp... How far does this analogy go? For example, if I plot how long both programs take at various scales, at some point I should be able to determine which one is O(n log(n)) right?

DannyBee on May 25, 2023 [–]

I gave the formal definition of distinguishability in the other comment, but it does not include running time.

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