• remi_pan@sh.itjust.works
    link
    fedilink
    arrow-up
    1
    ·
    5 months ago

    I know I shouldn’t do it here, but let me ask a serious question : does the square in O(n!²) really matter ? I have a confused intuition that the factorial grows so much faster than the square that it kind of disapears assymptoticaly.

  • stingpie@lemmy.world
    link
    fedilink
    arrow-up
    0
    arrow-down
    1
    ·
    5 months ago

    Everything can be done in constant time, at least during runtime, with a sufficiently large look-up table. It’s easy! If you want to simulate the universe exactly, you just need a table with nxm entries, where n is the number of plank volumes in the universe, and m is the number of quantum fields. Then, you just need to compute all of them at compile time, and you have O(1) time complexity during runtime.