Articles liés à Enumerability · Decidability Computability: An Introduction...

Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions - Couverture souple

 
9783642461804: Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions

Synopsis

Once we have accepted a precise replacement of the concept of algo- rithm, it becomes possible to attempt the problem whether there exist well-defined collections of problems which cannot be handled by algo- rithms, and if that is the case, to give concrete cases of this kind. Many such investigations were carried out during the last few decades. The undecidability of arithmetic and other mathematical theories was shown, further the unsolvability of the word problem of group theory. Many mathematicians consider these results and the theory on which they are based to be the most characteristic achievements of mathe- matics in the first half of the twentieth century. 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. In view of the important role which mathematics plays today in our conception of the world this fact is of great philosophical interest. Post speaks of a natural law about the "limitations of the mathematicizing power of Homo Sapiens". Here we also find a starting point for the discussion of the question, what the actual creative activity of the mathematician consists in. In this book we shall give an introduction to the theory of algorithms.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

  • ÉditeurSpringer
  • Date d'édition2012
  • ISBN 10 3642461808
  • ISBN 13 9783642461804
  • ReliureBroché
  • Langueanglais
  • Nombre de pages264
  • Coordonnées du fabricantnon disponible

Acheter D'occasion

état :  Comme neuf
Like New
Afficher cet article
EUR 102,65

Autre devise

EUR 29,66 expédition depuis Royaume-Uni vers France

Destinations, frais et délais

Acheter neuf

Afficher cet article
EUR 48,37

Autre devise

EUR 9,70 expédition depuis Allemagne vers France

Destinations, frais et délais

Autres éditions populaires du même titre

9783540045014: Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions

Edition présentée

ISBN 10 :  3540045015 ISBN 13 :  9783540045014
Editeur : Springer-Verlag Berlin and Heide..., 1969
Couverture rigide

Résultats de recherche pour Enumerability · Decidability Computability: An Introduction...

Image fournie par le vendeur

Hans Hermes
Edité par Springer Berlin Heidelberg, 2012
ISBN 10 : 3642461808 ISBN 13 : 9783642461804
Neuf Couverture souple

Vendeur : moluna, Greven, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur 5061805

Contacter le vendeur

Acheter neuf

EUR 48,37
Autre devise
Frais de port : EUR 9,70
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Hans Hermes
Edité par Springer Berlin Heidelberg, 2012
ISBN 10 : 3642461808 ISBN 13 : 9783642461804
Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Once we have accepted a precise replacement of the concept of algo rithm, it becomes possible to attempt the problem whether there exist well-defined collections of problems which cannot be handled by algo rithms, and if that is the case, to give concrete cases of this kind. Many such investigations were carried out during the last few decades. The undecidability of arithmetic and other mathematical theories was shown, further the unsolvability of the word problem of group theory. Many mathematicians consider these results and the theory on which they are based to be the most characteristic achievements of mathe matics in the first half of the twentieth century. 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. In view of the important role which mathematics plays today in our conception of the world this fact is of great philosophical interest. Post speaks of a natural law about the 'limitations of the mathematicizing power of Homo Sapiens'. Here we also find a starting point for the discussion of the question, what the actual creative activity of the mathematician consists in. In this book we shall give an introduction to the theory of algorithms. N° de réf. du vendeur 9783642461804

Contacter le vendeur

Acheter neuf

EUR 53,49
Autre devise
Frais de port : EUR 10,99
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Hans Hermes
ISBN 10 : 3642461808 ISBN 13 : 9783642461804
Neuf Taschenbuch
impression à la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Once we have accepted a precise replacement of the concept of algo rithm, it becomes possible to attempt the problem whether there exist well-defined collections of problems which cannot be handled by algo rithms, and if that is the case, to give concrete cases of this kind. Many such investigations were carried out during the last few decades. The undecidability of arithmetic and other mathematical theories was shown, further the unsolvability of the word problem of group theory. Many mathematicians consider these results and the theory on which they are based to be the most characteristic achievements of mathe matics in the first half of the twentieth century. 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. In view of the important role which mathematics plays today in our conception of the world this fact is of great philosophical interest. Post speaks of a natural law about the 'limitations of the mathematicizing power of Homo Sapiens'. Here we also find a starting point for the discussion of the question, what the actual creative activity of the mathematician consists in. In this book we shall give an introduction to the theory of algorithms. 264 pp. Englisch. N° de réf. du vendeur 9783642461804

Contacter le vendeur

Acheter neuf

EUR 53,49
Autre devise
Frais de port : EUR 11
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Hermes, Hans
Edité par Springer, 2012
ISBN 10 : 3642461808 ISBN 13 : 9783642461804
Neuf Couverture souple

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. In. N° de réf. du vendeur ria9783642461804_new

Contacter le vendeur

Acheter neuf

EUR 62,10
Autre devise
Frais de port : EUR 4,73
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Hans Hermes
ISBN 10 : 3642461808 ISBN 13 : 9783642461804
Neuf Taschenbuch

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : Neu. Neuware -Once we have accepted a precise replacement of the concept of algo rithm, it becomes possible to attempt the problem whether there exist well-defined collections of problems which cannot be handled by algo rithms, and if that is the case, to give concrete cases of this kind. Many such investigations were carried out during the last few decades. The undecidability of arithmetic and other mathematical theories was shown, further the unsolvability of the word problem of group theory. Many mathematicians consider these results and the theory on which they are based to be the most characteristic achievements of mathe matics in the first half of the twentieth century. 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. In view of the important role which mathematics plays today in our conception of the world this fact is of great philosophical interest. Post speaks of a natural law about the 'limitations of the mathematicizing power of Homo Sapiens'. Here we also find a starting point for the discussion of the question, what the actual creative activity of the mathematician consists in. In this book we shall give an introduction to the theory of algorithms.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 264 pp. Englisch. N° de réf. du vendeur 9783642461804

Contacter le vendeur

Acheter neuf

EUR 53,49
Autre devise
Frais de port : EUR 15
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Hans Hermes
Edité par Springer-Verlag 1969-01-01, 1969
ISBN 10 : 3642461808 ISBN 13 : 9783642461804
Neuf Paperback

Vendeur : Chiron Media, Wallingford, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9783642461804

Contacter le vendeur

Acheter neuf

EUR 58,97
Autre devise
Frais de port : EUR 11,26
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : 10 disponible(s)

Ajouter au panier

Image d'archives

Hermes, Hans (Author)/ Herman, Gabor T. (Translated by)/ Plassmann, O. (Translated by)
Edité par Springer, 2012
ISBN 10 : 3642461808 ISBN 13 : 9783642461804
Neuf Paperback

Vendeur : Revaluation Books, Exeter, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Paperback. Etat : Brand New. 2nd reprint edition. 266 pages. 9.00x6.00x0.60 inches. In Stock. N° de réf. du vendeur x-3642461808

Contacter le vendeur

Acheter neuf

EUR 79,54
Autre devise
Frais de port : EUR 11,86
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Hermes, Hans
Edité par Springer, 2012
ISBN 10 : 3642461808 ISBN 13 : 9783642461804
Neuf Couverture souple

Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur ABLIING23Mar3113020228878

Contacter le vendeur

Acheter neuf

EUR 53,70
Autre devise
Frais de port : EUR 65,66
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Hermes, Hans
Edité par Springer, 2012
ISBN 10 : 3642461808 ISBN 13 : 9783642461804
Ancien ou d'occasion Paperback

Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni

Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

Paperback. Etat : Like New. Like New. book. N° de réf. du vendeur ERICA77336424618086

Contacter le vendeur

Acheter D'occasion

EUR 102,65
Autre devise
Frais de port : EUR 29,66
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier