computability theory

nodes

not organized. these were studied during computability course (some stuff werent in the curriculum though), they're relatively organized.

• computability practice problems
• algorithm
• S programming language
• program
• computably enumerable set
• computable structures
• recursive function
• recursive set
• turing machine
• turing reduction
• universality
• unbounded search operator
• recursion theorem
• polynomial time computability
• church's thesis
• pairing function
• godel numbering
• enumeration theorem
• the halting problem
• tot
• tractability
• language of a machine
• lambda calculus

books

  (princ
   (book-collage
    (list
     "blk:1709967487"
     "blk:1708288499"
     "blk:1710528539"
     "blk:1714980025"
     )))




  
  Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)
  Martin Davis, Ron Sigal, Elaine J. Weyuker
  1994


  
  Automata and Computability
  Dexter C. Kozen
  1997


  
  turing computability: theory and applications
  robert i. soare
  2016


  
  Thery of Recursive Functions and Effective Computability
  Hartley Rogers
  1987