Recursion theory

From Free net encyclopedia

Recursion theory, or computability theory, is a branch of mathematical logic dealing with generalizations of the notion of computable function, and with related notions such as Turing degrees and effective descriptive set theory.

[edit]

References

  • Hartley Rogers, Jr., The Theory of Recursive Functions and Effective Computability, MIT Press, ISBN 0262680521 (paperback), ISBN 0070535221 (textbook)

Template:Mathlogic-stubpl:Teoria rekursji zh:递归论

Retrieved from "http://www.netipedia.com/index.php/Recursion_theory"