1 / 7

A Pseudocode Compiler

A Pseudocode Compiler. J. Nicholas Deibel PoCSi ’02 May 17, 2002. The n -monkey problem. “What do I do with all these monkeys?!?” — Dijkstra, 1987. The n- monkey problem. A specific text t n = # of monkeys b = # of bananas c = # of cigarettes

janina
Télécharger la présentation

A Pseudocode Compiler

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Pseudocode Compiler J. Nicholas Deibel PoCSi ’02 May 17, 2002

  2. The n-monkey problem “What do I do with all these monkeys?!?” — Dijkstra, 1987

  3. The n-monkey problem A specific text t n = # of monkeys b = # of bananas c = # of cigarettes f(n) = the fecal projectile probability The probability of generating text t is:

  4. A Pseudocode Compiler

  5. Weak NLP Problems

  6. Results • Windows ME source code: • Compiled in 78 hours successfully. • A description of Windows ME: • Compiled in 3 hours. IE was not bundled with it. • Crime and Punishment: • 20 minutes and created a music-swapping system.

  7. Deadly Repercussions THIS SLIDE BLACKED OUT FOR YOUR PROTECTION

More Related