Computability in combinatory spaces : an algebraic generalization of abstract first order computability
Author(s)
Bibliographic Information
Computability in combinatory spaces : an algebraic generalization of abstract first order computability
(Mathematics and its applications, . East European series ; v. 55)
Kluwer Academic Publishers, c1992
- Other Title
-
Kombinatornye prostranstva i rekursivnostʹ v nikh
Available at 19 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Rev. translation of: Kombinatorny postranstva i rekursivnostʹ v nikh. 1980
Includes bibliographical references (p. [301]-314) and indexes
Description and Table of Contents
Description
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. The main chapter 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 treats a survey of examples of combinatory spaces. All sections of the chapters contain exercises together with hints for solution where appropriate. For the reading of some parts of the book a knowledge of mathematical logic and recursive function theory would be desirable. The text is mainly aimed at researchers and specialists of mathematical logic and its applications, as well as theoretical computer scientists.
Table of Contents
- Computational structures and computability on them
- combinatory spaces
- computability in iterative combinatory spaces. Appendix: A survey of examples of combinatory spaces.
by "Nielsen BookData"