P vs. NP: Internet virology
Posted in the Computer Science Forum
#1 Nov 28, 2010
"P vs. NP" is a famous problem in computer science which asks, "if a computer can verify a solution, can it compute the answer to the problem?" This problem refers to the generic question, "can a computer compute on its own if its algorithm is complex enough to generate random-association computation?" Such a question is important when considering what connection factors build the self-replicating qualities of Internet viruses.
In other words, if a human being who has computational skills programs a computer to mimic his/her computational skills, can the computer theoretically generate its own self-replicating algorithms of conscious or random intelligence? Can it do so without incurring the replication distortion problems of, say, Internet viruses?
Such considerations fall under the realm of combinatorics mathematics (i.e., matrix mechanics), of course, and help human beings tackle problems of Internet equilibrium virology control.
Do these considerations illuminate the symbolic appeal of the Hollywood (USA) movie "The Matrix" (1999)?
Are they printing movie posters on hemp/recycled paper yet?
Add your comments below
|Why Facebook's 'People You May Know' makes some...||Jul 30||Christaliban||1|
|Newly Discovered Biomarkers May Lead to Promisi...||Jul 30||Big Johnson||1|
|Asbestos Cleanse Discovery Needed||Jun '17||bluebell||1|
|Leaked NSA doc highlights deep flaws in US elec...||Jun '17||spud||104|
|Leaked NSA doc highlights deep flaws in US elec...||Jun '17||spud||11|
|Leaked NSA document highlights deep flaws in U....||Jun '17||Cordwainer Trout||4|
|Prince Andrew opens new world-class research fa...||Jun '17||Daisy||1|
Find what you want!
Search Computer Science Forum Now
Copyright © 2017 Topix LLC