Lectures on Constructive Mathematics. - Mathematics, Algorithms ...
Lectures on Constructive Mathematics. - Mathematics, Algorithms ...
Lectures on Constructive Mathematics. - Mathematics, Algorithms ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
C<strong>on</strong>sider the statement:<br />
LPO For each binary sequence a (an) n>1 either an = 0 for all n; or<br />
else there exists N such that a N = 1:<br />
This is trivially true under classical logic.<br />
What is its BHK interpretati<strong>on</strong>?<br />
We have an algorithm which, applied to any binary sequence a, either<br />
produces a proof that an = 0 for each n; or else computes N such<br />
that a N = 1:<br />
Claim: Such an algorithm is unlikely to be found.