News for hackers. Stuff that matters.
Re:Mathematics in type theory by xelxebar on Thursday June 25, 2020 @12:52AM (#23637037)
> > ... a function is both its implementation and its "extension" (its effect on all inputs).

> Note that, according to definition of 'function' most common in math, this is false.

The standard definition of function in ZFC is a set of tuples pairing every "input" with an "output", so I think the previous commenter was correct with this reading.

> A function need not even be implementable.

However, if you are alluding to computable functions, then certainly, the story is a lot more interesting!

There are no comments on this comment yet.