Hakuluettelo:
Käännös:
recursion theory (suomeksi)
- Määritelmät:
- (lb, en, logic) A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as "What does it mean for a function from the natural numbers to themselves to be computable?" and "Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?".