加载中…
个人资料
MEMASHTPLECT_519
MEMASHTPLECT_519
  • 博客等级:
  • 博客积分:0
  • 博客访问:258,549
  • 关注人气:54
  • 获赠金笔:0支
  • 赠出金笔:0支
  • 荣誉徽章:
相关博文
推荐博文
谁看过这篇博文
加载中…
正文 字体大小:

翻译《mathematics》wiki版

(2009-09-26 14:09:57)
标签:

杂谈

Discrete mathematics

Discrete mathematics is the common name for the fields of mathematics most generally useful in theoretical computer science.

离散数学是最普遍的数学理论计算机科学领域的有益的通用名称。

This includes computability theory, computational complexity theory, and information theory. Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model – the Turing machine.

这包括可计算性理论,计算复杂性理论,信息理论。可计算性理论探讨了计算机的各种理论模型的局限性,包括已知的最强大的模式, -图灵机。

Complexity theory is the study of tractability by computer; some problems, although theoretically solvable by computer, are so expensive in terms of time or space that solving them is likely to remain practically unfeasible, even with rapid advance of computer hardware.

复杂性理论是易处理计算机的研究;一些问题,虽然理论上由电脑可解,如此昂贵的时间或空间,解决他们的条件很可能保持实际上并不可行,即使电脑硬件的迅速发展。

Finally, information theory is concerned with the amount of data that can be stored on a given medium, and hence deals with concepts such as compression and entropy.

最后,信息理论关注的是,可以在给定的介质存储的数据量,从而处理如压缩和熵的概念。

As a relatively new field, discrete mathematics has a number of fundamental open problems. The most famous of these is the "P=NP?" problem, one of the Millennium Prize Problems.[34] 

作为一个相对较新的领域,离散数学有一个基本的开放问题。其中最有名的是的“P =NP”问题,在千禧年大奖难题之一。

0

阅读 评论 收藏 转载 喜欢 打印举报/Report
  • 评论加载中,请稍候...
发评论

    发评论

    以上网友发言只代表其个人观点,不代表新浪网的观点或立场。

      

    新浪BLOG意见反馈留言板 欢迎批评指正

    新浪简介 | About Sina | 广告服务 | 联系我们 | 招聘信息 | 网站律师 | SINA English | 会员注册 | 产品答疑

    新浪公司 版权所有