De Aller-Bedste Bøger - over 12 mio. danske og engelske bøger
Levering: 1 - 2 hverdage

Enumerability * Decidability Computability

- An Introduction to the Theory of Recursive Functions

Bag om Enumerability * Decidability Computability

If we grant the legitimacy of the suggested precise replacements of the concept of algorithm and related concepts, then we can say that the mathematicians have shown by strictly mathematical methods that there exist mathematical problems which cannot be dealt with by the methods of calculating mathematics.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9783642461804
  • Indbinding:
  • Paperback
  • Sideantal:
  • 250
  • Udgivet:
  • 29. februar 2012
  • Udgave:
  • 21969
  • Størrelse:
  • 234x156x14 mm.
  • Vægt:
  • 406 g.
  • 8-11 hverdage.
  • 13. december 2024
Forlænget returret til d. 31. januar 2025

Normalpris

Abonnementspris

- Rabat på køb af fysiske bøger
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding

Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.

Beskrivelse af Enumerability * Decidability Computability

If we grant the legitimacy of the suggested precise replacements of the concept of algorithm and related concepts, then we can say that the mathematicians have shown by strictly mathematical methods that there exist mathematical problems which cannot be dealt with by the methods of calculating mathematics.

Brugerbedømmelser af Enumerability * Decidability Computability



Find lignende bøger
Bogen Enumerability * Decidability Computability findes i følgende kategorier: