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
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (236)
Orphanage
Unclass'd (1)
Unproven (540)
Corrections (51)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Copyright
About
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. examples of unlimited register machines owned by CWoo
  9. Kleene's theorem owned by CWoo
  10. Levin reduction owned by Henry
  11. LL(k) owned by CWoo
  12. LR(k) owned by CWoo
  13. matrix characterizations of automata owned by CWoo
  14. non-deterministic finite automaton owned by mps
  15. non-deterministic pushdown automaton owned by Henry
  16. non-deterministic Turing machine owned by Henry
  17. oracle owned by Henry
  18. quantum nano-automata owned by bci1
  19. recursive function is URM-computable owned by CWoo
  20. reduced automaton owned by CWoo
  21. self-reducible owned by Henry
  22. subset construction owned by CWoo
  23. Turing computable owned by rspuzio
  24. Turing machine owned by Henry
  25. universal Turing machine owned by tromp
  26. unlimited register machine owned by CWoo
  27. URM computable owned by CWoo

Show empty categories:
[ up | top ]