Enumerability, Decidability, Computability

Available
72.00 £
E-book
pdf
The task of developing algorithms to solve problems has always been considered by mathematicians to be an especially interesting and im­ portant one. Normally an algorithm is applicable only to a narrowly limited group of problems. Such is for instance the Euclidean algorithm, which determines the greatest common divisor of two numbers, or the well-known procedure which is used to obtain the squar...
Read more
The task of developing algorithms to solve problems has always been considered by mathematicians to be an especially interesting and im­ portant one. Normally an algorithm is applicable only to a narrowly limited group of problems. Such is for instance the Euclidean algorithm, which determines the greatest common divisor of two numbers, or the well-known procedure which is used to obtain the squar...
Read more
Follow the Author

Options

  • Formats: pdf
  • ISBN: 9783662116869
  • Publication Date: 14 Mar 2013
  • Publisher: Springer Berlin Heidelberg
  • Product language: English
  • Drm Setting: DRM