PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Encyclopedia by subject

68Q05 - Computer science :: Theory of computing :: Models of computation

  1. combining URMs owned by CWoo
  2. computable number owned by AxelBoldt
  3. constructing automata from regular languages owned by CWoo
  4. Cook reduction owned by Henry
  5. deterministic finite automaton owned by CWoo
  6. deterministic pushdown automaton owned by CWoo
  7. deterministic Turing machine owned by Henry
  8. encoding words owned by CWoo
  9. examples of primitive recursive encoding owned by CWoo
  10. examples of unlimited register machines owned by CWoo
  11. formal definition of a Turing machine owned by CWoo
  12. Kleene's theorem owned by CWoo
  13. Levin reduction owned by Henry
  14. LL(k) owned by CWoo
  15. LR(k) owned by CWoo
  16. matrix characterizations of automata owned by CWoo
  17. non-deterministic finite automaton owned by mps
  18. non-deterministic pushdown automaton owned by Henry
  19. non-deterministic Turing machine owned by Henry
  20. oracle owned by Henry
  21. primitive recursive encoding owned by CWoo
  22. primitive recursive number owned by CWoo
  23. quantum nano-automata owned by bci1
  24. recursive function is URM-computable owned by CWoo
  25. reduced automaton owned by CWoo
  26. self-reducible owned by Henry
  27. subset construction owned by CWoo
  28. Turing computable owned by rspuzio
  29. Turing machine owned by Henry
  30. universal Turing machine owned by tromp
  31. unlimited register machine owned by CWoo
  32. URM computable owned by CWoo

Show empty categories:
[ up | top ]