• Yendor
    link
    fedilink
    arrow-up
    2
    arrow-down
    2
    ·
    1 year ago

    A maths major could point out edges cases where the maths terminology works but the computer code break, but for broad-strokes purposes they’re the same.

    • mohKohn@kbin.social
      link
      fedilink
      arrow-up
      1
      arrow-down
      2
      ·
      1 year ago

      what? they’re just for loops (actually they’re better described as reduce operators, but those are not so friendly either). if you mean infinite bounds, it’s just not finitely terminating

      • Kogasa@programming.dev
        link
        fedilink
        arrow-up
        2
        ·
        1 year ago

        If the bounds are infinite then it’s defined by a limit of partial sums, which isn’t the same as a non-terminating algorithm. It would be pretty tough if we couldn’t evaluate limits. It’s also important to understand limits as being a precisely defined operation as opposed to a way of saying “and so on.”