recursion theorem
type: Concept
preferred label: قضیه بازگشت @fa
related: computation machine

polynomial time
type: Concept
preferred label: زمان چندجمله‌ای @fa
related: computation machine

nP-complete problem
type: Concept
preferred label: مسئله np-کامل @fa
related: computation machine

decidability
type: Concept
preferred label: تصمیم‌پذیری @fa
related: computation machine

Lambda calculus
type: Concept
preferred label: حساب لاندا @fa
related: computation machine

recursively enumerable
type: Concept
preferred label: شمارش‌پذیر بازگشتی @fa
related: computation machine

Church thesis
type: Concept
broader: computation machine
preferred label: تز چرچ @fa

Turing machine
type: Concept
broader: computation machine
preferred label: ماشین تورینگ @fa

register machine
type: Concept
broader: computation machine
preferred label: ماشین ثبت @fa

random access machine
type: Concept
broader: computation machine
preferred label: ماشین دستیابی تصادفی @fa

halting problem
type: Concept
broader: computation machine
preferred label: مسئله توقف @fa

computation machine
type: Concept
broader: computability
narrower: random access machine
narrower: register machine
narrower: halting problem
narrower: Church thesis
narrower: Turing machine
preferred label: ماشین محاسبه @fa
related: recursively enumerable
related: recursion theorem
related: polynomial time
related: nP-complete problem
related: CONP problem
related: Lambda calculus
related: decidability

CONP problem
type: Concept
preferred label: مسئله CONP @fa
related: computation machine

computability
type: Concept
narrower: computation machine
preferred label: محاسبه‌پذیری @fa