computability theory

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