$e^{e^{e^{79}}}$ and ultrafinitism I was reading the following article on Ultrafinitism, and it mentions that one of the reasons ultrafinitists believe that N is not infinite is because the floor of $e^{e^{e^{79}}}$ is not computable. I was wondering if that's the case because of technological limitations, or whether there is another reason we cannot find a floor of this number.
 A: In the formal meaning of "computable" the floor of that number is indeed computable. This is to say that a patient immortal human with access to unlimited paper and pencil could, in principle, work out the answer. (Here I assume, for technical reasons, that the number in question is not an integer - I assume someone who knows enough number theory will be able to cite a result that implies this.)
The article linked makes the weaker claim that the value has not yet been calculated, which seems likely to me. The issue they are concerned about is that humans are not immortal and that our supply of paper is very limited. If the number of decimal digits in the value is too large, it would be impossible to actually represent it in any physical way within our universe. 
In general, I think it is more accurate to say that ultrafinitists don't accept that the set of all natural numbers is a coherent entity - not that they think it is finite. However, as the article you linked alludes, it is very difficult to find a coherent but non-arbitrary way to say what natural numbers are without accepting that there are an infinite number of them.  
Addendum Here is why I am worried whether $e^{e^{e^{79}}}$ is an integer. It's certainly correct that no matter what, the floor of that number is an integer and is therefore computable. That part of my argument is fine.
On the other hand, if $e^{e^{e^{79}}}$ is not an integer, then I can tell you a specific algorithm to use to compute it. Namely, compute better and better upper and lower bounds until they fall strictly between two consecutive integers (which they must, since their limit is not an integer) and then pick the smaller of those two integers.  
If $e^{e^{e^{79}}}$ is an integer, then that algorithm won't work, because it will never stop. But if we knew that $e^{e^{e^{79}}}$ was an integer then we could take better and better upper and lower approximations until they straddle a single integer, and then pick that. 
So the reason that I am interested whether the number is an integer is that, beyond merely knowing that the floor is an integer, I'd like to know which algorithm could be used to compute it. 
In any case, I don't think that the point of the example was to pick a number that is not known to be integer or known to not be an integer. The point of the example should be to pick a number which is simply too large to represent physically.  I was hoping that someone would have a quick answer that confirms $e^{e^{e^{79}}}$ is not an integer, so I could edit my response with that info. But the non-integer property seems more difficult than I thought. 
