--- On Thu, 9/18/08, Pei Wang <[EMAIL PROTECTED]> wrote: > URL: http://nars.wang.googlepages.com/wang.CaseByCase.pdf
I think it would be interesting if you had some experimental results. Could CPS now solve a problem like "sort [3 2 4 1]" in its current state? If not, how much knowledge does it need, and how long would it run? How long would it take to program its knowledge base? Would CPS then use its experience to help it solve similar problems like "sort [4 2 4 3]"? Could you give an example of a problem that CPS can now solve? What is your opinion on using CPS to solve hard problems, like factoring 1000 digit numbers, or finding strings x and y such that x != y and MD5(x) = MD5(y). Do you think that CPS could find clever solutions such as the collisions found by Wang and Yu? If so, what resources would be required? MD5 cryptographic one way hash standard: http://www.ietf.org/rfc/rfc1321.txt Attack on MD5: http://web.archive.org/web/20070604205756/http://www.infosec.sdu.edu.cn/paper/md5-attack.pdf -- Matt Mahoney, [EMAIL PROTECTED] ------------------------------------------- agi Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: https://www.listbox.com/member/?member_id=8660244&id_secret=114414975-3c8e69 Powered by Listbox: http://www.listbox.com
