未读消息消息

店铺

我的订单收藏

拍卖

拍卖交易我的竞拍收藏

我的好友资金账户

客服 |

帮助中心 9:00-20:30 在线留言

客服电话

010-89648155

服务时间

客服咨询 8:00-21:00

纠纷处理 9:00-21:00

图书审核 9:00-18:00

监督与建议

请选择

手机孔网

Computability and Complexity in Analysis分析的可计算性与复杂性

Computability and Complexity in Analysis分析的可计算性与复杂性

分享

作者: Jens Blanck 著

出版社: 湖南文艺出版社

出版时间: 2001-06

版次: 1

ISBN: 9783540421979

定价: 599.88

装帧: 平装

开本: 其他

纸张: 胶版纸

页数: 393页

分类: 外文古旧书>英文书>工程技术

The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community,with numerous individuals, as well as with prestigious organizations and　societies, LNCS has grown into the most comprehensive computer science research forum available.


  The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes.

  - proceedings (published in time for the respective conference)

  - post-proceedings (consisting of thoroughly revised final full papers)

  - research m0nographs (which may be based on outstanding PhD work,research projects, technical reports, etc.) Computability and Complexity in Analysis

  Effectivity of Regular Spaces

  The Degree of Unsolvability of a Real Number

  A Survey of Exact Arithmetic Implementations

  Standard Representations of Effective Metric Spaces

  Banach-Mazur Computable Functions on Metric Spaces

  A Generic Root Operation for Exact Real Arithmetic

  Effective Contraction Theorem and Its Application

  Polynomially Time Computable Functions over p-Adic Fiel

  On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems

  Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory

  Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations

　бApproximable Functions

  Computabilities of Fine-Continuous Functions

  The iRRAM: Exact Arithmetic in CA-+

  The Uniformity Conjecture

  Admissible Representations of Limit Spaces

  Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions

  Effective Fixed Point Theorem over a Non-computably Separable Metric Space

  Computational Dimension of Topological Spaces

  Some Properties of the Effective Uniform Topological Space

  On Computable Metric Spaces Tietze-Urysohn Extension Is Computable

  Is the Linear Schrodinger Propagator Turing Computable?

  A Computable Spectral Theorem

Report on Competition

  Exact Real Arithmetic Systems: Results of Competition

Author Index
内容简介:
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community,with numerous individuals, as well as with prestigious organizations and　societies, LNCS has grown into the most comprehensive computer science research forum available.


  The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes.

  - proceedings (published in time for the respective conference)

  - post-proceedings (consisting of thoroughly revised final full papers)

  - research m0nographs (which may be based on outstanding PhD work,research projects, technical reports, etc.)
目录:
Computability and Complexity in Analysis

  Effectivity of Regular Spaces

  The Degree of Unsolvability of a Real Number

  A Survey of Exact Arithmetic Implementations

  Standard Representations of Effective Metric Spaces

  Banach-Mazur Computable Functions on Metric Spaces

  A Generic Root Operation for Exact Real Arithmetic

  Effective Contraction Theorem and Its Application

  Polynomially Time Computable Functions over p-Adic Fiel

  On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems

  Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory

  Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations

　бApproximable Functions

  Computabilities of Fine-Continuous Functions

  The iRRAM: Exact Arithmetic in CA-+

  The Uniformity Conjecture

  Admissible Representations of Limit Spaces

  Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions

  Effective Fixed Point Theorem over a Non-computably Separable Metric Space

  Computational Dimension of Topological Spaces

  Some Properties of the Effective Uniform Topological Space

  On Computable Metric Spaces Tietze-Urysohn Extension Is Computable

  Is the Linear Schrodinger Propagator Turing Computable?

  A Computable Spectral Theorem

Report on Competition

  Exact Real Arithmetic Systems: Results of Competition

Author Index

查看详情

相关分类

Literature&Fiction文学与虚构 ScienceFiction&Fantasy科幻与玄幻 Romance浪漫小说 Mystery&Thrillers神秘与惊悚 Teens青少年读物 Biographies&Memoirs传记与自传 Comics&GraphicNovels动漫与绘画小说 ELT英语学习 Reference参考书 StandardTest标准考试 Business&Investing商业与投资 Self-Help励志自助 ManagementLeadership经营管理 Arts&Photography艺术与摄影

目前没有书店销售此书