Overcoming the "Halting Problem" in a proof P=NP.
Loading...
Loading...
2,414
Link to this comment:
Share to:
Loading...
- 2:22How To Dust-Proof Your Homeby Howcast13,836 views
Featured Video
- 50:08Introduction to P and NPby UCDavis3,166 views
- 9:59Lecture 13 - The Halting Problem (Part 2/7)by Coderisland2,111 views
- 4:48The Halting Problem - Part 1by kjlg743,751 views
- 2:28CERN: [Clear Visual Proof: P!==NP]by martymusatov1,724 views
- 1:50Using the Halting Problem to refute zkueker88by mungbeanman579 views
- 1:07Proof of the Halting Problem Solved by 'Musatov...by martymusatov643 views
- 9:56The Death of Alan Turingby mishima197060,067 views
- 0:25NP Hard Optimalityby muntimehdi1,628 views
- 14:01P=NP by Rehan Deen 1:3by JackBeijingable64 views
- 5:01Fast Maths Trick of Calculationby glad2teach1,884,716 views
- 1:44Erik Demaine proves P=NP....April Fools!by MITCSAIL50,686 views
- 1:40A diagrammatic representation of the complexity...by SillyBoyProjects549 views
- 0:54Difference between Software Engineering and Com...by codingkriggs68,766 views
- 2:43Graph Layout using force based approachby badmephisto9,819 views
- 1:24Barack Obama - Computer Science Questionby weedipikia673,837 views
- 1:59The P Versus NP Problemby protheory11,299 views
- 1:14Tony, the halting problem, and his virginity.by Catalina368040 views
- 1:56Re: 2MinuteChallenge- Turing machinesby lovelyhitsugaya1,744 views
- 5:46CS105 - Halting Problemby Rutgers639 views
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