Computability Theory

Pathway

Pages are grouped by how many dependency steps into this group they sit. Everything a page needs from this group appears above it.

1. Level 0

   1 page
   • level 0Formal Languages, Encodings, and Decision Problems18 results

     This page fixes the pre-machine vocabulary for the computability theory track: finite words over an alphabet, languages and their basic operations, reversal and induced…

     9 definitions, 6 lemmas, 1 proposition, 2 false statementsExamples & counterexamples →