Computability, Enumerability, Unsolvability

Du sparer 0% ift. normalprisen Spar 0%

Paperback
8-11 hverdage
620,95 kr.

Bag om Computability, Enumerability, Unsolvability

The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory.

Vis mere

Sprog:
Engelsk

ISBN:
9780521557368

Forlag:
Cambridge University Press

Indbinding:
Paperback

Sideantal:
356

Udgivet:
11. januar 1996

Størrelse:
152x228x21 mm.

Vægt:
507 g.

Leveringstid: 8-11 hverdage.
Forventet levering: 3. december 2024

På lager

Normalpris

BLACK NOVEMBER
620,95 kr. + Fragt
~~620,95 kr.~~

Medlemspris

577,95 kr.

Prøv i 30 dage for 45 kr.
Herefter fra 79 kr./md. Ingen binding.

Beskrivelse af Computability, Enumerability, Unsolvability

The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory.

Brugerbedømmelser af Computability, Enumerability, Unsolvability

Andre købte også..

Find lignende bøger

Bogen Computability, Enumerability, Unsolvability findes i følgende kategorier:

Business og læring > Computer og IT

Computability, Enumerability, Unsolvability - Bog

Beskrivelse af Computability, Enumerability, Unsolvability

Brugerbedømmelser af Computability, Enumerability, Unsolvability

Gør som tusindvis af andre bogelskere