Data Structures and Algorithms

    

A New Simple Constructive Proof of Kannan’s Theorem

Authors: Sunny Daniels

I appreciate the feedback from Fortnow (the author of [1]) on my recent viXra article [2], and inparticular him supplying me with a definition of the standard polynomial-time universal Turingmachine[4]. In [3], I clarified the way in which my construction and proofs in [2] could be re-worked to be analogous to the more usual definition of a universal Sigma_2^P Turing machine.Shortly after publishing [2], I realised that my construction in [2] or [3] gives rise to a very, verysimple new constructive proof of Kannan’s theorem: much simpler than anything that has beenpublished before, if I am not mistaken, and even simpler than my proposed "layer by layer" proof in[2]. I suspect that Fornow realised this soon after reading [2]: his e-mail correspondence with meseems to hint at this. If so, I appreciate him giving me the opportunity to pubish this new proofmyself!I present a sketch of this new proof here.

Comments: 4 Pages. "Complexity Theory" would almost certainly be the best arXiv category for this paper, but there doesn't seem to be any corresponding viXra category.

Download: PDF

Submission history

[v1] 2023-08-09 22:25:25

Unique-IP document downloads: 258 times

Vixra.org 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. Vixra.org 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