Name: Bounded Queries in Recursion Theory
Price: 1165.95 DKK
Availability: InStock
Author: Georgia Martin
ISBN: 9780817639662

Bounded Queries in Recursion Theory af Georgia Martin

Du sparer 0% ift. normalprisen Spar 0%

Hardback
8-11 hverdage
1.165,95 kr.

Bag om Bounded Queries in Recursion Theory

The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it.

Vis mere

Sprog:
Engelsk

ISBN:
9780817639662

Forlag:
Birkhauser Boston Inc

Indbinding:
Hardback

Sideantal:
353

Udgivet:
23. december 1998

Udgave:
1999

Størrelse:
235x155x22 mm.

Vægt:
1550 g.

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

Normalpris

BLACK WEEK
1.165,95 kr. + Fragt
~~1.165,95 kr.~~

Medlemspris

1.115,95 kr.

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

Bag om Georgia Martin

Vis alle bøger af Georgia Martin

Beskrivelse af Bounded Queries in Recursion Theory

The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it.

Brugerbedømmelser af Bounded Queries in Recursion Theory

Andre købte også..

Find lignende bøger

Bogen Bounded Queries in Recursion Theory findes i følgende kategorier:

Business og læring > Computer og IT

Bounded Queries in Recursion Theory - Georgia Martin - Bog

Bag om Georgia Martin

Beskrivelse af Bounded Queries in Recursion Theory

Brugerbedømmelser af Bounded Queries in Recursion Theory

Gør som tusindvis af andre bogelskere