CSE 431 Projects

Spring 2001

 

Historical Investigations:

 

Jiang-Jiang Cheng – “Ancient Chinese Contributions to Computing”

 

Kevin Chu, Cephas Lin – “Davis’ The Universal Computer verses McCartney’s ENIAC”

 

Stephanie Couch – "From Theory Into Being: A Look at the Legal Woes of the ENIAC Team"

 

Erin Earl – “Alan Turing”

 

Javin Elliff - "The History of the Computer as told by Martin Davis versus Martin Campbell-Kelly and William Aspray"

 

Danielle Farrar, Karen Tu -  "Computational Theory: History and Future"

 

Ben Handy -  "Gödel"

 

Lindsey Irwin – “Eniac, One of Many Great Achievements in Computing”

 

Ryszard Kwiecinski – “Engineers and Logicians”

 

Chia-Chi Li – “ENIAC: The Triumphs and Tragedies of the World’s First Computer, written by Scott McCartney”

 

Peter Liang - "A Comparison Between Davis’ and Goldstein’s Views on Historical Development of the Computer"

 

Jeff Maurer, Chelsie Pentz - "The Algorithm and the Universal Computer"

 

Sean McManus - "Contributions of Logicians and Engineers to the Invention of the Computer"

 

Michael Nelson – “Historical Perspectives: Martin Davis vs. H.H. Goldstein”

 

Christopher Sanders – “Automated Logic: The Computer and its Conception”

 

Ian Slade – “Alan Turing: Eccentric Intellectual or Brilliant Visionary”

 

Albert Wong - "Evolution of  Analytical Thought"

 

 

Research Investigations:

 

Scott Anson  -  “Graph Isomorphism and Problems of Related Complexity: Implications on the Structure of NP - P”

 

Irina Aronova - “NP-Complete Scheduling Problems”

 

Jiang-Jiang Cheng – “PRIMES is in NP”

 

Ben Chao – “NP of Primes”

 

Amer Dahmash – “Undecidability of the Natural Numbers under Addition and Multiplication”

 

Mike Fernandes, Shirley Gaw – “Testing for primality is in NP”

 

Dan Hoke, Ben Nordstrom – “Zero-knowledge Proof Systems”

 

Kristen Jaskie – “Computational Power of the Human Brain (with applications to Neural Networks)”

 

Sergy Kolesnik – “Tiling Problems”

 

Brett Kotschwar – “On the Complexity of LR(k) Testing for Free k”

 

Daniel MacDonald – “Gödel’s First Theorem”

 

Jeremy Moody – “An Overview of Some Picture Language Subclasses”

 

Matthew Nguyen – “The Simple Game Sokoban is PSPACE-Hard”

Jacob Spindel – “Efficient Algorithms for Recognition of General Context-Free Grammars”

Hannah C. Tang – “On The Expressive Power of Several General Grammars”

 

Rodger Visitacion – “Primality Testing Using Randomized Algorithms and  Elliptic Curves”

 

Tahleb Zeghmi – “Theory of the Reals with Addition and Multiplication is Decidable”