Mohlo by se vám také líbit

Více informací o knize Theories of Computability

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 409 bodů

Anotace knihy

This 1997 book gives an introduction to theories of computability from a mathematically sophisticated point of view. It treats not only 'the' theory of computability (created by Alan Turing and others in the 1930s), but also a variety of other theories (of Boolean functions, automata and formal languages). These are addressed from the classical perspective of their generation by grammars and from the modern perspective as rational cones. The treatment of the classical theory of computable functions and relations takes the form of a tour through basic recursive function theory, starting with an axiomatic foundation and developing the essential methods in order to survey the most memorable results of the field. This authoritative account by one of the leading lights of the subject will prove exceptionally useful reading for graduate students, and researchers in theoretical computer science and mathematics.

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics Mathematical foundations

• Plný název: Theories of Computability
• Autor: Nicholas Pippenger
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 264
• EAN: 9780521553803
• ISBN: 0521553806
• ID: 02034960
• Nakladatelství: Cambridge University Press
• Hmotnost: 535 g
• Rozměry: 229 × 152 × 19 mm
• Datum vydání: 28. May 1997

Oblíbené z jiného soudku

---

---

---