General Mathematics


Feasible Mathematics

Authors: Alexandre Harvey-Tremblay

From algorithmic information theory (and using notions of algorithmic thermodynamics), we introduce *feasible mathematics* as distinct from *universal mathematics*. Feasible mathematics formalizes the intuition that theorems with very long proofs are unprovable within the context of limited computing resources. It is formalized by augmenting the standard construction of Omega with a conjugate-pair that suppresses programs with long runtimes. The domain of the new construction defines feasible mathematics.

Comments: 12 Pages.

Download: PDF

Submission history

[v1] 2018-01-02 09:27:57
[v2] 2018-01-10 09:44:26

Unique-IP document downloads: 44 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus