Difference between revisions of "Cs488-2009"

From Earlham CS Department
Jump to navigation Jump to search
Line 1: Line 1:
 
Put your name next to four of the chapters that you will be responsible for teaching the rest of us this semester with a presentation and short assignment.  If one of the ones you were interested in is already taken please choose another in its place.
 
Put your name next to four of the chapters that you will be responsible for teaching the rest of us this semester with a presentation and short assignment.  If one of the ones you were interested in is already taken please choose another in its place.
  
−
# ALGORITHMS Cooking Up Programs - your name here
 
−
# FINITE AUTOMATA The Black Box - your name here
 
−
# SYSTEMS OF LOGIC Boolean Bases - your name here
 
 
# SIMULATION The Monte Carlo Method - '''Samuel'''
 
# SIMULATION The Monte Carlo Method - '''Samuel'''
−
# GÖDEL'S THEOREM Limits on Logic - your name here
 
 
# GAME TRESS The Minimax Method - '''Brad'''
 
# GAME TRESS The Minimax Method - '''Brad'''
−
# THE COMSKY HIERARCHY Four Computers - your name here
 
−
# RANDOM NUMBERS The Chaitin-Kolmogoroff Theory - your name here
 
 
# MATHEMATICAL RESEARCH The Mandelbrot Set - '''Nate'''
 
# MATHEMATICAL RESEARCH The Mandelbrot Set - '''Nate'''
−
# PROGRAM CORRECTNESS Ultimate Debugging - your name here
 
−
# SEARCH TRESS Traversal and Maintenance - your name here
 
−
# ERROR-CORRECTING CODE Pictures from Space - your name here
 
−
# BOOLEAN LOGIC Expressions and Circuits - your name here
 
−
# REGULAR LANGUAGE Pumping Words - your name here
 
−
# TIME AND SPACE COMPLEXITY The Big-0 Notation - your name here
 
 
# GENETIC ALGORITHMS Solutions That Evolve - '''Brad'''
 
# GENETIC ALGORITHMS Solutions That Evolve - '''Brad'''
−
# THE RANDOM ACCESS MACHINE An Abstract Computer - your name here
 
−
# SPINAL CURVES Smooth Interpolation - your name here
 
 
# COMPUTER VISION Polyhedral Scenes - '''Brad'''
 
# COMPUTER VISION Polyhedral Scenes - '''Brad'''
−
# KARNAUGH MAPS Circuit Minimization - your name here
 
−
# THE NEWTON-RAPHSON METHOD Finding Roots - your name here
 
−
# MINIMUM SPANNING TREES A Fast Algorithm - your name here
 
−
# GENERATIVE GRAMMARS Lindenmayer Systems - your name here
 
−
# RECURSION The Sierpinski Curve - your name here
 
−
# FAST MULTIPLICATION Divide and Conquer - your name here
 
−
# NONDETERMINISM Automata That Guess Correctly - your name here
 
 
# PERCEPTIONS A Lack of Vision - '''Nate'''
 
# PERCEPTIONS A Lack of Vision - '''Nate'''
−
# ENCODERS AND MULTIPLEXERS Manipulating Memory - your name here
 
−
# CAT SCANNING Cross-Sectional X-Rays - your name here
 
−
# TIE PARTITION PROBLEM A Pseudo-fast Algorithm - your name here
 
−
# TURING MACHINES The Simplest Computers - your name here
 
−
# THE FAST FOURIER TRANSFORM Redistributing Images - your name here
 
 
# ANALOG COMPUTATION Spaghetti Computers - '''Sam Leeman-Munk'''
 
# ANALOG COMPUTATION Spaghetti Computers - '''Sam Leeman-Munk'''
−
# SATISFIABILITY A Central Problem - your name here
 
−
# SEQUENTIAL SORTING A Lower Bound on Speed - your name here
 
 
# NEURAL NETWORKS THAT LEARN Converting Coordinates - '''Samuel'''
 
# NEURAL NETWORKS THAT LEARN Converting Coordinates - '''Samuel'''
 
# PUBLIC KEY CRYPTOGRAPHY Intractable Secrets - '''Samuel'''
 
# PUBLIC KEY CRYPTOGRAPHY Intractable Secrets - '''Samuel'''
−
# SEQUENTIAL CIRCUITS A Computer Memory - your name here
 
−
# NONCOMPUTABLE FUNCTIONS The Busy Beaver Problem - your name here
 
−
# HEAPS AND MERGES The Fastest Sorts of Sorts - your name here
 
−
# NP-COMPLETENESS Wall of Intractability - your name here
 
 
# NUMBER SYSTEMS FOR COMPUTING Chinese Arithmetic - '''Aaron'''
 
# NUMBER SYSTEMS FOR COMPUTING Chinese Arithmetic - '''Aaron'''
−
# STORAGE BY HASHING The Key Is the Address - your name here
 
 
# CELLULAR AUTOMATA The Game of Life - '''Sam Leeman-Munk'''
 
# CELLULAR AUTOMATA The Game of Life - '''Sam Leeman-Munk'''
 
# COOK'S THEOREM Nuts and Bolts - '''Aaron'''
 
# COOK'S THEOREM Nuts and Bolts - '''Aaron'''
Line 50: Line 17:
 
# THE SCRAM A Simplified Computer - '''Dylan'''
 
# THE SCRAM A Simplified Computer - '''Dylan'''
 
# SHANNON'S THEORY The Elusive Codes - '''Aaron'''
 
# SHANNON'S THEORY The Elusive Codes - '''Aaron'''
−
# DETECTING PRIMES An Algorithm that Almost Always Works - your name here
 
−
# UNIVERSAL TURING MACHINES Computers as Programs - your name here
 
−
# TEXT COMPRESSION Huffman Coding - your name here
 
−
# DISK OPERATING SYSTEMS Bootstrapping the Computer - your name here
 
 
# NP-COMPLETE PROBLEMS The Tree of Intractability - '''Aaron'''
 
# NP-COMPLETE PROBLEMS The Tree of Intractability - '''Aaron'''
 
# ITERATION AND RECURSION The Towers of Hanoi - '''Dylan'''
 
# ITERATION AND RECURSION The Towers of Hanoi - '''Dylan'''
 
# VLSI COMPUTERS Circuits in Silicon - '''Dylan'''
 
# VLSI COMPUTERS Circuits in Silicon - '''Dylan'''
−
# LINEAR PROGRAMMING The Simplex Method - your name here
 
−
# PREDICATE CALCULUS The Resolution Method - your name here
 
 
# THE HALTING PROBLEM The Uncomputable - '''Sam Leeman-Munk'''
 
# THE HALTING PROBLEM The Uncomputable - '''Sam Leeman-Munk'''
 
# COMPUTER VIRUSES A Software Invasion - '''Brad'''
 
# COMPUTER VIRUSES A Software Invasion - '''Brad'''
−
# SEARCHING STRINGS The Boyer-Moore Algorithm - your name here
 
−
# PARALLEL COMPUTING Processors with Connections - your name here
 
−
# THE WORD PROBLEM Dictionaries as Programs - your name here
 
 
# LOGIC PROGRAMMING Prologue to Expertise - '''Nate'''
 
# LOGIC PROGRAMMING Prologue to Expertise - '''Nate'''
 
# RELATIONAL DATABASES Do-It-Yourself Queries - '''Samuel'''
 
# RELATIONAL DATABASES Do-It-Yourself Queries - '''Samuel'''
−
# CHURCH'S THESIS All Computers Are Created Equal  - your name here
 

Revision as of 13:03, 16 September 2009

Put your name next to four of the chapters that you will be responsible for teaching the rest of us this semester with a presentation and short assignment. If one of the ones you were interested in is already taken please choose another in its place.

  1. SIMULATION The Monte Carlo Method - Samuel
  2. GAME TRESS The Minimax Method - Brad
  3. MATHEMATICAL RESEARCH The Mandelbrot Set - Nate
  4. GENETIC ALGORITHMS Solutions That Evolve - Brad
  5. COMPUTER VISION Polyhedral Scenes - Brad
  6. PERCEPTIONS A Lack of Vision - Nate
  7. ANALOG COMPUTATION Spaghetti Computers - Sam Leeman-Munk
  8. NEURAL NETWORKS THAT LEARN Converting Coordinates - Samuel
  9. PUBLIC KEY CRYPTOGRAPHY Intractable Secrets - Samuel
  10. NUMBER SYSTEMS FOR COMPUTING Chinese Arithmetic - Aaron
  11. CELLULAR AUTOMATA The Game of Life - Sam Leeman-Munk
  12. COOK'S THEOREM Nuts and Bolts - Aaron
  13. SELF-REPLICATING COMPUTERS Codd's Machine - Sam Leeman-Munk
  14. STORING IMAGES A Cat in a Quad Tree - Nate
  15. THE SCRAM A Simplified Computer - Dylan
  16. SHANNON'S THEORY The Elusive Codes - Aaron
  17. NP-COMPLETE PROBLEMS The Tree of Intractability - Aaron
  18. ITERATION AND RECURSION The Towers of Hanoi - Dylan
  19. VLSI COMPUTERS Circuits in Silicon - Dylan
  20. THE HALTING PROBLEM The Uncomputable - Sam Leeman-Munk
  21. COMPUTER VIRUSES A Software Invasion - Brad
  22. LOGIC PROGRAMMING Prologue to Expertise - Nate
  23. RELATIONAL DATABASES Do-It-Yourself Queries - Samuel
Retrieved from "https://wiki.cs.earlham.edu/index.php?title=Cs488-2009&oldid=10245"