找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Exploring RANDOMNESS; Gregory J. Chaitin Book 2001 Springer-Verlag London 2001 LISP.Randomness.Ringe.Turing machine.algorithms.complexity.

[复制链接]
查看: 22665|回复: 46
发表于 2025-3-21 17:10:17 | 显示全部楼层 |阅读模式
书目名称Exploring RANDOMNESS
编辑Gregory J. Chaitin
视频video
丛书名称Discrete Mathematics and Theoretical Computer Science
图书封面Titlebook: Exploring RANDOMNESS;  Gregory J. Chaitin Book 2001 Springer-Verlag London 2001 LISP.Randomness.Ringe.Turing machine.algorithms.complexity.
描述In The Unknowable I use LISP to compare my work on incompleteness with that of G6del and Turing, and in The Limits of Mathematics I use LISP to discuss my work on incompleteness in more detail. In this book we‘ll use LISP to explore my theory of randomness, called algorithmic information theory (AIT). And when I say "explore" I mean it! This book is full of exercises for the reader, ranging from the mathematical equivalent oftrivial "fin­ ger warm-ups" for pianists, to substantial programming projects, to questions I can formulate precisely but don‘t know how to answer, to questions that I don‘t even know how to formulate precisely! I really want you to follow my example and hike offinto the wilder­ ness and explore AIT on your own! You can stay on the trails that I‘ve blazed and explore the well-known part of AIT, or you can go off on your own and become a fellow researcher, a colleague of mine! One way or another, the goal of this book is to make you into a participant, not a passive observer of AlT. In other words, it‘s too easy to just listen to a recording of AIT, that‘s not the way to learn music.
出版日期Book 2001
关键词LISP; Randomness; Ringe; Turing machine; algorithms; complexity; logic; sets; algorithm analysis and problem
版次1
doihttps://doi.org/10.1007/978-1-4471-0307-3
isbn_softcover978-1-4471-1085-9
isbn_ebook978-1-4471-0307-3
copyrightSpringer-Verlag London 2001
The information of publication is updating

书目名称Exploring RANDOMNESS影响因子(影响力)




书目名称Exploring RANDOMNESS影响因子(影响力)学科排名




书目名称Exploring RANDOMNESS网络公开度




书目名称Exploring RANDOMNESS网络公开度学科排名




书目名称Exploring RANDOMNESS被引频次




书目名称Exploring RANDOMNESS被引频次学科排名




书目名称Exploring RANDOMNESS年度引用




书目名称Exploring RANDOMNESS年度引用学科排名




书目名称Exploring RANDOMNESS读者反馈




书目名称Exploring RANDOMNESS读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:45:44 | 显示全部楼层
https://doi.org/10.1007/978-1-4684-1887-3s in these proofs running on the computer. And in order to write these programs, we need to use a programming language. Unfortunately, no existing programming language is exactly what is needed. So I invented a dialect of LISP that will do the job. In this chapter I’ll explain the version of LISP th
发表于 2025-3-22 02:52:01 | 显示全部楼层
Bond Properties of Self-Compacting Concrete,put graphs. This is our most basic tool. We’ll use it many times: over and over again in what’s left of Part II and in Part III. In fact, using this technique is at the heart of the next two chapters, it’s really what these two chapters are about.
发表于 2025-3-22 05:03:48 | 显示全部楼层
发表于 2025-3-22 12:09:21 | 显示全部楼层
发表于 2025-3-22 14:56:31 | 显示全部楼层
Myoung-Woon Moon,Chansoo Kim,Ashkan Vaziridefinition of a random real. The resulting definition is, in my opinion, a substantial improvement: it’s much easier to apply. And in the next chapter we’ll be able to use it to show that Ω is strong Chaitin random.
发表于 2025-3-22 17:17:56 | 显示全部楼层
发表于 2025-3-23 00:08:34 | 显示全部楼层
Bond Properties of Self-Compacting Concrete,put graphs. This is our most basic tool. We’ll use it many times: over and over again in what’s left of Part II and in Part III. In fact, using this technique is at the heart of the next two chapters, it’s really what these two chapters are about.
发表于 2025-3-23 04:41:19 | 显示全部楼层
Chigbogu Ozoegwu,Peter Eberhardchapter I’ll show you two . definitions of a random real that look very different from my program-size irreducibility definition, but which actually turn out to be equivalent. These are P. Martin-Löf’s and R.M. Solovay’s definitions of a random real, and I’ll start with Martin-Löfs definition, which was proposed before Solovay’s.
发表于 2025-3-23 06:01:14 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-11 12:17
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表