Total Posts: 1
| Main List | POST TO THIS TOPIC |
81stPercentile Senior Member United StatesPosts: 2956
Reply | 16 Aug 2012, 12:25:09   P=NP; In Computer Science{?} In essence, {and an 'unsolved problem' I was made aware of by 'surfing'}; "Can an unsolved math-related problem, that can be efficiently checked by a computer; Also be efficiently solved by a computer?" - My best guess, is that the premise is faulty! {even, if it were to refer to, futuristic 'quantum computers'}. As 'Godel's Theorem' recognizes.. without directly saying so; When dealing with 'unsolved mathematical problems'; You're inevitably talking about: "Does the solution hold true, for an 'infinity' of numbers?" .. Since 'infinity' is a synonym, for 'never ending' {D-u-h?!}; I, or anyone, for that matter; Could no more begin, to answer that question; Than be able to tell you, if the 'Maple Leafs' will one day win the 'World Series'!? ..{contingent of course, on some 'MLB' team.. first changing their 'nickname' to 'Maple Leafs'!?}. -- |
| Main List | POST TO THIS TOPIC |

Senior Member
United States