pedocomputing a generalized framework for polynomial time solution of np problems l.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Pedocomputing: A Generalized Framework for Polynomial-Time Solution of NP Problems PowerPoint Presentation
Download Presentation
Pedocomputing: A Generalized Framework for Polynomial-Time Solution of NP Problems

Loading in 2 Seconds...

play fullscreen
1 / 15

Pedocomputing: A Generalized Framework for Polynomial-Time Solution of NP Problems - PowerPoint PPT Presentation


  • 316 Views
  • Uploaded on

Pedocomputing: A Generalized Framework for Polynomial-Time Solution of NP Problems. Gary Yngve. Alternative Computing Paradigms. Quantum computing DNA computing Necrocomputing. Pedocomputing. Solves NP problems in poly-time Adaptable to approximation algorithms

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Pedocomputing: A Generalized Framework for Polynomial-Time Solution of NP Problems' - Roberta


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
alternative computing paradigms
Alternative Computing Paradigms
  • Quantum computing
  • DNA computing
  • Necrocomputing
pedocomputing
Pedocomputing
  • Solves NP problems in poly-time
  • Adaptable to approximation algorithms
  • AI and graphics applications
previous work
Previous Work
  • Swift’s modest proposal
  • Gifford, et al.
  • Nike
  • Everquest
  • The Catholic Church
poly time solution to np problems
Poly-time solution to NP problems
  • Create an exponential number of children in poly-time
  • Exponential number of children = exponential number of pedoflops
  • Children model nondeterministic Turing machine
applications for ai
Applications for AI
  • Five million P4 processors do not even come close to reproducing the mental abilities of a 5-year-old.
  • With pedocomputing, five million 5-year-olds do a damn good job at reproducing the mental abilities of five million 5-year-olds.
conclusions
Conclusions
  • Pedocomputing solves NP problems in poly-time
  • Applications to approximation algorithms, AI, and graphics
acknowledgements and apologies
Acknowledgements and Apologies
  • Eugene Hsu for finding the childish mentalities for the drawings
  • Lounge denizens
  • The Catholic Church
  • Hannah Tang