Vi bøger
Trustpilot
Levering: 1 - 2 hverdage
Hjælp
Login
  1. Forside
  2. Bøger
  3. Business og læring
  4. Computer og IT
  5. Bounded Queries in Recursion Theory

Bounded Queries in Recursion Theory - Georgia Martin - Bog

af Georgia Martin, William Levine

indgår i Progress in Computer Science and Applied Logic serien

Bounded Queries in Recursion Theory af Georgia Martin
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:
  • 9781461268482
  • Indbinding:
  • Paperback
  • Sideantal:
  • 353
  • Udgivet:
  • 13. juli 2013
  • Udgave:
  • 11999
  • Størrelse:
  • 235x155x20 mm.
  • Vægt:
  • 569 g.
  • 8-11 hverdage.
  • 16. januar 2025

Normalpris

Medlemspris

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:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.