Posts

I Am Retracting My Godel's Lost Letter Proof

  While applying to jobs, I have been working somewhat on P vs. NP.  I realized that the issue is, if you have, say, a wf that is 1000 characters long that you want to prove, and ZFC is consistent...then yes, the proof of the inconsistency might be, say, 8000 characters long.  The problem is, to fully write out the proof in this way, you will have to write down the wf some number of times--say, 13 times (not just 1).  (There is a specific number of times at minimum but I haven't calculated it out.). The issue, in addition to the relativization barrier, is, there might be another proof where enough space to prove the wf using the inconsistency has not ben provided, but, there might or might not be a shorter proof that does not use the  (possibly very long) proof of the inconsistency that writes down the (also possibly very long) wf fewer than 13 times, or however many times at minimum the wf must appear. I am considering a different approach to P vs. NP. ...
Post a Comment
Read more

Yo, Check Out My (Growing) GitHub.com Page!

  http://www.github.com/cplxphil/
Post a Comment
Read more

An Interesting Article On AI-Faked Evidence In Court That I Read Part Of

  https://journals.library.columbia.edu/index.php/stlr/article/view/13890/7671
Post a Comment
Read more

Evidence Fabricated With AI Tools

  I realized today that my parents *definitely* used AI tools to fabricate evidence.  It's a horrible thing to do to one's disabled son. Anyway, I've continued making progress on my online Python course that I'm taking.  I am going to try to get 100% on all of the projects.  I also have a plan to build 5 other web-based projects in Python to try to help me get a good job in Python.  It'll take a few months to get all of that done, but it should be worth it. Also, I'm now on disability, and as soon as I get my first check of money, I'm going to try to find a new lawyer. I'm also working on relaxing and feeling good.  Right now, I'm listening to this excellent relaxation music video, which I have liked for a while:   https://www.youtube.com/watch?v=1ZYbU82GVz4&list=RD1ZYbU82GVz4&start_radio=1&t=1794s My goal for my mood is to feel *triumphant* and *tranquil* for some amount of time every day.  Also, I am trying to congratulate myself on ...
Post a Comment
Read more

My quantum computing proof

  My quantum computing proof is coming along!  It looks very salvageable.  I am planning to take some internet courses.  I am taking one very excellent one that I think will help me get a very good job within a few months :).  Later, I'll take another one on academic publishing, and publish my quantum computing paper, that shows that there are is a sort of way to place the modular square root problem in BQP.  The catch is, I need another oracle, so really, given that language X, it's, NP is a subset of BQP^X.  The good news is, although X is not known to be in polynomial time, in practice, it's typically easy to compute. No more updates for now!
Post a Comment
Read more

D'oh

  I found out that my NP in BQP result was not correct.  The issue is with the generator.  I tried to fix it but I couldn't get it to work. It's OK.  My online courses are going well.  I don't feel a major need to update this blog that much.  No one is reading it all that much.  Everything will be OK though.  I will get a good lawyer when I have the money, and I should be able to get a good job after my coursework and portfolio are complete. Update: There might be a way to salvage this idea, but it won't be perfect.  I'll think about it some more. :)
Post a Comment
Read more

My 2 big math achievements

  Two big achievements:  - I solved GLL.  - I showed that you can put NP in BQP. A note on the second one:  You have to get the generator right.  It's easy.  You look at the value of a, the thing you're taking the sqrt of, and you have to see what prime factors it has in common with the modulus. Then, you take each instance of the prime factor that is in common between those two, and multiply them together.  To "stay on the modular rail road track" so to speak, you have to make sure that that product is a divisor of your generator, and, that all other factors of the generator are coprime to the modulus. That's how you select the generator to solve MSR using a DLP algorithm.
Post a Comment
Read more