Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Punto Poste 5.49 € Punto Poste 5.49 € Corriere DHL 6.99 € Corriere GLS 5.99 € Punto GLS 4.49 € Corriere Bartolini 4.49 € Punto Bartolini 3.49 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Theories of Computability

Name: Theories of Computability
Brand: Cambridge University Press
SKU: 02024027
Price: 53.59 EUR
Availability: InStock
Author: Nicholas Pippenger
ISBN: 9780521153430

Nicholas Pippenger

Lingua

Inglese

Libro In brossura

Codice Libristo: 02024027

Casa editrice Cambridge University Press, giugno 2010

This 1997 book gives an introduction to theories of computability from a mathematically sophisticate... Descrizione completa

Codice Libristo: 02024027

131 b

53.59 €

Magazzino esterno Inviamo tra 14-21 giorni

Fino a 30 giorni per il reso

I clienti hanno acquistato anche

Estatuto psico-emocional dos pais de crianças que vivem com ASD: Christian BALUMUENE MUANYISHA

In brossura

53.69 €

Белегът на Мили Стела Нова

In brossura

11.49 €

La ricerca dell'identit? nei romanzi di Patrick Modiano Basma Mahmoud

In brossura

63.29 €

Modern Chinese Poetry Written with Classical Metrical Rhythm Richard Hsiao

Adobe ePub DRM

11.39 €

Plazas mayores y ayuntamientos de Castilla-La Mancha HERRERA CASADO

Libro

15.29 €

La Bizkaia de Navarra. Memorias de un valle en silencio Recalde Recalde

In brossura

30.39 €

Le design du travail en action Cahier

In brossura

22.29 €

Mussoliniho holič Graeme Donald

Rigido

9.59 €

Palabra de robot : inteligencia artificial y comunicación Óscar Vilarroya Oliver

In brossura

16.19 €

Torre de Babel ? Ultimo piso Michael Laitman

In brossura

7.89 €

Un Habitat de Bosque = A Forest Habitat Bobbie Kalman

Rigido

28.69 €

Chronologie des Alten Reichs und der I. Zwischenzeit im UEberblick Ludmila Lang

In brossura

15.99 €

Raumordnung in der Kommunalpolitik Stephan Marik-Lebeck

In brossura

21.29 €

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.