Bienvenue chez nous !
Logo Ex Libris
 Laissez-vous inspirer ! 

Computability in Combinatory Spaces

  • Couverture cartonnée
  • 340 Nombre de pages
(0) Donner la première évaluation
Évaluations
(0)
(0)
(0)
(0)
(0)
Afficher toutes les évaluations
One service mathematics bas rendered the 'Bt moi, .... si j'avait su comment en revenir, je human race. It bas put commo... Lire la suite
CHF 130.00
Impression sur demande - Habituellement expédié sous 4 à 6 semaines.
Commande avec livraison dans une succursale

Description

One service mathematics bas rendered the 'Bt moi, .... si j'avait su comment en revenir, je human race. It bas put common sense back n'y semis point aU6.' where it belongs, on the topmost shelf next to Jules Verne the dusty canister labelled 'discarded nonsense'. BrieT.Bell The series is divergent; therefore we may be able to do something with it. O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlineari ties abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sci ences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One ser vice topology has rendered mathematical physics .. .'; 'One service logic has rendered computer science .. .'; 'One service category theory has rendered mathematics .. .'. All arguably true. And all statements obtainable this way form part of the raison d' 8tre of this series.

Texte du rabat

This volume provides an account of the current state of the theory of combinatory spaces and discusses various applications. Here the term `combinatory space' can be regarded as a system for functional programming, and bears no close connection with combinatory logic. br/ The main text is divided into three chapters. Chapter 1 deals with computational structures and computability; Chapter 2 considers combinatory spaces; and Chapter 3 embraces computability in iterative combinatory spaces. A number of appendices treat a survey of examples of combinatory spaces. All sections of the various chapters contain exercices togethers with hints for solution where appropriate. br/ For the reading of some parts of the book a knowledge of mathematical logic and recursive function theory would be desirable. br/ For researchers and specialists in mathematical logic and its applications and theoretical computer scientists. br/



Contenu

Preface. I. Computational Structures and Computability on Them. II. Combinatory Spaces. III. Computability in Iterative Combinatory Spaces. Appendix: A Survey of Examples of Combinatory Spaces. References. Additional Bibliography. Index of Names. Index of Definitions.

Informations sur le produit

Titre: Computability in Combinatory Spaces
Auteur:
Code EAN: 9789401051651
ISBN: 9401051658
Format: Couverture cartonnée
Editeur: Springer Netherlands
nombre de pages: 340
Poids: 545g
Taille: H240mm x B160mm x T18mm
Année: 2012
Auflage: Softcover reprint of the original 1st ed. 1992

Autres articles de cette série  "Mathematics and its Applications"