ABSTRACT
It is conceivable that geometry plays a much more fundamental role in Na
ture’s computation (or Nature’s laws) than is currently realized. An indication
that this may indeed be the case is obtained by contrasting two fundamental
results by Godel and Tarski in the domain of the foundations of mathematics
[5]:
1. the incompleteness result of Godel (1931) shows that N is too scarce to
always imply decidability in arithmetic,
2. the decidability of elementary geometry on M proved by Tarski (1929)
shows that M is rich enough as a basis field.
