Comment by SAI_Peregrinus
14 hours ago
"Computable" has a well-known standard definition in this context, meaning a computable function[1]. In a given model of computation, a computable function is one for which an algorithm exists which computes the value of the function for every value of its argument. For example, the successor function adds 1 to an input number, and is computable. The halting problem (determine whether a program given in the argument halts) is not computable.
> "Computable" has a well-known standard definition in this context, meaning a computable function
Indeed. Also every integer is computable, and a computation doesn't have size. That's what everyone is telling in the comments.