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

Proofs and Algorithms

Bag om Proofs and Algorithms

Proofs and Algorithms: An Introduction to Logic and ComputabilityLogic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.Proofs and Algorithms: An Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel's incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself.Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9780857291202
  • Indbinding:
  • Paperback
  • Sideantal:
  • 156
  • Udgivet:
  • 14. januar 2011
  • Udgave:
  • 2011
  • Størrelse:
  • 156x17x238 mm.
  • Vægt:
  • 252 g.
  • 8-11 hverdage.
  • 10. december 2024
På lager

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 Proofs and Algorithms

Proofs and Algorithms: An Introduction to Logic and ComputabilityLogic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.Proofs and Algorithms: An Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel's incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself.Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.

Brugerbedømmelser af Proofs and Algorithms



Find lignende bøger
Bogen Proofs and Algorithms findes i følgende kategorier: