Computability in Combinatory Spaces
查字典图书网
当前位置: 查字典 > 图书网 > Computability in Combinatory Spaces

Computability in Combinatory Spaces

0.0

作者: Dimiter G·Skordev
出版年: 1992-3
页数: 336
定价: $ 111.87
ISBN: 9780792315766



推荐文章

猜你喜欢

附近的人在看

推荐阅读

拓展阅读

内容简介:

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.

展开全文
暂无评论
暂无评论
  • 大家都在看
  • 小编推荐
  • 猜你喜欢
  •