Thus no infinitesimal is computable
This one had me going. It depends on how we define computability for infinitesimals. If we define it one way, every infinitesimal is computable. Define it another way, and none are.
Let's review the definition of computability. We say a real number $$x$$ is
computable if, given a real number $$\epsilon > 0$$, there is a Turing machine (TM) that halts in a finite number of steps, outputing a decimal approximation of $$x$$ to within $$\epsilon$$.
Earlier I mentioned that a real is computable if a TM can crank out its decimal digits. If you think about it, these two definitions are equivalent.
When we ask if an infinitesimal can be computable, one answer is, "The question is meaningless." It's like asking if an apple is a Rastafarian. The concept of religious affiliation only applies to people, not to deciduous fruits. Computability only applies to reals, not to hyperreals. [The hyperreals are a nonstandard model of the reals that contains infinitesimals].
But we can ask ourselves if we can extend the definition of computability in some way. Suppose we use the same definition of above but let $$x$$ be an infinesimal element of the hyperreals.
Let $$x$$ be infinitesimal. There are two cases:
* We require $$\epsilon > 0$$ to be real. Then I claim that
every infinitesimal is computable. Why is that? Well, if you give me $$\epsilon > 0$$, by definition $$x$$ is ALREADY within $$\epsilon$$ of $$0$$. So the Turing machine:
approximates $$x$$ within $$\epsilon$$. That's one way to look at it.
* Or, what if we allow $$\epsilon$$ itself to be infinitesimal? Then no infinitesimal can be computable. An infinitesimal looks like something of the form $$\frac{1}{10^N}$$ where $$N$$ is a hyperinteger; that is, an infinite integer in the hyperreals. Such a hyperinteger can not be reached or expressed in a finite number of steps I believe. [I would not stake my life on this but I'm pretty sure based on what I know about the hyperreals].
But frankly the best answer might be that the question is meaningless. Computability is about approximating real numbers with Turing machines. It wasn't meant to apply to infinitesimals and as you can see, it doesn't really give much insight either way. Either every infinitesimal is computable or none are, depending on the definition you choose. But no actual insight into the nature of infinitesimals is gained by this exercise.