Crossword Dictionary

Enter a description, or enter a word with dots for missing letters

Show answer

47 crossword answers for “Computability theory”

LOW
HIGH
FORCING
INDEX SET (5,3)
PA DEGREE (2,6)
RECURSION
SIMPLE SET (6,3)
Μ OPERATOR (2,8)
BUSY BEAVER (4,6)
ENUMERATOR
MAXIMAL SET (7,3)
NORMAL FORM (6,4)
SMN THEOREM (3,7)
K-TRIVIAL SET (9,3)
BASIS THEOREM (5,7)
RECURSIVE SET (9,3)
TURING DEGREE (6,6)
COMPUTABILITY
MARTIN MEASURE (6,7)
ORACLE MACHINE (6,7)
AUTOMATIC GROUP (9,5)
HARDY HIERARCHY (5,9)
LAMBDA CALCULUS (6,8)
ARITHMETICAL SET (12,3)
DOUBLE RECURSION (6,9)
COMPUTABLE NUMBER (10,6)
ACKERMANN FUNCTION (9,8)
BOUNDED QUANTIFIER (7,10)
COMPLETE NUMBERING (8,9)
DESCRIPTION NUMBER (11,6)
MCCARTHY FORMALISM (8,9)
RECURSIVE LANGUAGE (9,8)
CHURCH-TURING THESIS (13,6)
COMPUTABILITY LOGIC (13,5)
COMPUTABLE ANALYSIS (10,8)
COMPUTABLE FUNCTION (10,8)
FRIEDBERG NUMBERING (9,9)
Μ-RECURSIVE FUNCTION (12,8)
ANALYTICAL HIERARCHY (10,9)
FAST-GROWING HIERARCHY (12,9)
GRZEGORCZYK HIERARCHY (11,9)
KOLMOGOROV COMPLEXITY (10,10)
SLOW-GROWING HIERARCHY (12,9)
COURSE-OF-VALUES RECURSION (16,9)
HYPERARITHMETICAL THEORY (17,6)
ALGORITHM CHARACTERIZATIONS (9,17)
CHURCH-TURING-DEUTSCH PRINCIPLE (21,9)