Overcoming the "Halting Problem" in a proof P=NP.
1:45
Added: 2 years ago
From: martymusatov
Views: 2,414
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:
see all

All Comments (2)

Sign In or Sign Up now to post a comment!

  • What this nonsense is about?

    J0EH3AD 1 year ago

  • I don't quite think this would cut it for anything involving P vs. NP. I think you have Computability confused with Complexity. P vs. NP has nothing much to do with the halting problem. Like I understand everything you are using in terms of technical terms and viewed your page.

    Entertainmentwf 1 year ago

View all Comments »
Loading...
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more