找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computability and Decidability; An Introduction for Jacques Loeckx Textbook 1972 Springer-Verlag Berlin · Heidelberg 1972 Decidability.com

[复制链接]
查看: 35462|回复: 38
发表于 2025-3-21 18:01:42 | 显示全部楼层 |阅读模式
书目名称Computability and Decidability
副标题An Introduction for
编辑Jacques Loeckx
视频video
丛书名称Lecture Notes in Economics and Mathematical Systems
图书封面Titlebook: Computability and Decidability; An Introduction for  Jacques Loeckx Textbook 1972 Springer-Verlag Berlin · Heidelberg 1972 Decidability.com
描述The present Lecture Notes evolved from a course given at the Technische Hogeschool Eindhoven and later at the Technische Hogeschool Twente. They are intended for computer science students; more specifically, their goal is to introduce the notions of computability and decidability, and to prepare for the study of automata theory, formal language theory and the theory of computing. Except for a general mathematical background no preliminary knowledge is presupposed, but some experience in programming may be helpful. While classical treatises on computability and decidability are oriented towards the foundation of mathematics or mathematical logic, the present notes try to relate the subject to computer science. Therefore, the expose is based on the use of strings rather than on that of natural numbers; the notations are similar to those in use in automata theory; in addition, according to a common usage in formal language theory, most of the proofs of computability are reduced to the semi-formal description of a procedure the constructivity of which is apparent to anybody having some programming experience. Notwithstanding these facts the subject is treated with mathematical rigor; a
出版日期Textbook 1972
关键词Decidability; computability; computer; computer science; logic; sets
版次1
doihttps://doi.org/10.1007/978-3-642-80689-6
isbn_softcover978-3-540-05869-4
isbn_ebook978-3-642-80689-6Series ISSN 0075-8442 Series E-ISSN 2196-9957
issn_series 0075-8442
copyrightSpringer-Verlag Berlin · Heidelberg 1972
The information of publication is updating

书目名称Computability and Decidability影响因子(影响力)




书目名称Computability and Decidability影响因子(影响力)学科排名




书目名称Computability and Decidability网络公开度




书目名称Computability and Decidability网络公开度学科排名




书目名称Computability and Decidability被引频次




书目名称Computability and Decidability被引频次学科排名




书目名称Computability and Decidability年度引用




书目名称Computability and Decidability年度引用学科排名




书目名称Computability and Decidability读者反馈




书目名称Computability and Decidability读者反馈学科排名




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

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:46:21 | 显示全部楼层
https://doi.org/10.1007/978-1-4615-0331-6Some definitions concerning strings, sequences of strings and sets of strings are introduced and a few properties are indicated. Particular attention is paid to the enumeration of all strings or ordered sequences of strings over a given vocabulary.
发表于 2025-3-22 04:00:14 | 显示全部楼层
Performance of stress echocardiography,The Turing machine is introduced both by describing its physical model and by giving a formal (algebraic) definition for it. The notion of computability of (.-string) functions is derived from it. Finally, it is proved that any Turing machine may be replaced by a Turing machine of a particular type, called “normal” Turing machine.
发表于 2025-3-22 07:36:56 | 显示全部楼层
发表于 2025-3-22 09:51:59 | 显示全部楼层
发表于 2025-3-22 14:05:53 | 显示全部楼层
发表于 2025-3-22 19:16:11 | 显示全部楼层
Sets and Functions,Some notions and definitions related to sets and functions are briefly recalled.
发表于 2025-3-22 21:15:13 | 显示全部楼层
Sets and Functions of Strings,Some definitions concerning strings, sequences of strings and sets of strings are introduced and a few properties are indicated. Particular attention is paid to the enumeration of all strings or ordered sequences of strings over a given vocabulary.
发表于 2025-3-23 05:27:56 | 显示全部楼层
Computable Functions,The Turing machine is introduced both by describing its physical model and by giving a formal (algebraic) definition for it. The notion of computability of (.-string) functions is derived from it. Finally, it is proved that any Turing machine may be replaced by a Turing machine of a particular type, called “normal” Turing machine.
发表于 2025-3-23 05:47:37 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-29 15:59
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表