AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Rank, It's the Number of Arguments That a Function Takes.
The rank of a function is the number of arguments that it takes. It's central to understanding explicit iteration, because just as you can reduce a list with a binary operator,. You can reduce it with a matrix. If you take a dictionary in which all the values are also valid keys, then you've got a finite state machine and you can use that to traverse. Each of those unary functions has got rank one. My list hasrank one. So my list of unary functions have ranked two. Now, this is the thing that bothers me.