园友接待 规章 你问我答 新手资源 宣传 活动 资源超市 检索 代理 国外 精品 VIP 初级 中级 学术嘉宾 群英会 版主 区版 管委 邀请朋友 (有奖!)

科研经验 投稿 基金 课件 科软 会议 教学 精品馆 互助 硕博 标准求助|共享 书籍 S 考研 考博 英语 资格 公务员 考试精品 工作 留学 交友

数学 物理 化学化工 生命 地学 环境 机械 力学 能源 材料 土建 水利 信息 电力 电子 信息工程 理综 药学 医学 外科 内科 妇儿五官 公卫 医综

文史哲 外语 法学 经济 年鉴 报告 管理与教育 文学原创 零点家园 影音 美图 脑力 体育 健康生活 时尚 心理 美食 医护 电脑网络 百宝箱

返回列表 回复 发帖

[经验交流] Introductiion to Computing [David Evans]

[经验交流] Introductiion to Computing [David Evans]

本帖最后由 samsonc 于 14-9-6 01:20 编辑



Introduction to Computing
Explorations in Language, Logic, and Machines
David Evans


Computer science studies how to describe, predict properties of, and efficiently implement information processes. This book introduces the most important ideas in computing using the Scheme and Python programming languages. It focuses on how to describe information processes by defining procedures, how to analyze the costs required to carry out a procedure, and the fundamental limits of what can and cannot be computed mechanically.

Errata (last update: 13 October 2013) 266 pages

Contents

Front Matter
Preface
Introduction

Chapter 1: Computing
1.1 Processes, Procedures, and Computers
1.2 Measuring Computing Power (Information, Representing Data, Growth of Computing Power)
1.3 Science, Engineering, and the Liberal Arts
1.4 Summary and Roadmap
Exercises and solutions:

Part I: Defining Procedures

Chapter 2: Language
2.1 Surface Forms and Meanings
2.2 Language Construction
2.3 Recursive Transition Networks
2.4 Replacement Grammars
2.5 Summary
Exercises and solutions:

Chapter 3: Programming
3.1 Problems with Natural Languages
3.2 Programming Languages
3.3 Scheme
3.4 Expressions (Primitives, Application Expressions)
3.5 Definitions
3.6 Procedures (Making Procedures, Substitution Model of Evaluation)
3.7 Decisions
3.8 Evaluation Rules
3.9 Summary
Exercises and solutions:

Chapter 4: Problems and Procedures
4.1 Solving Problems
4.2 Composing Procedures (Procedures as Inputs and Outputs)
4.3 Recursive Problem Solving
4.4 Evaluating Recursive Applications
4.5 Developing Complex Programs (Printing. Tracing)
4.6 Summary
Exercises and solutions:

Chapter 5: Data
5.1 Types
5.2 Pairs (Making Pairs, Triples to Octuples)
5.3 Lists
5.4 List Procedures (Procedures that Examine Lists, Generic Accumulators, Procedures that Construct Lists)
5.5 Lists of Lists
5.6 Data Abstraction
5.7 Summary of Part I
Code
Exercises and solutions:

Part II: Analyzing Procedures

Chapter 6: Machines
6.1 History of Computing Machines
6.2 Mechanizing Logic (Implementing Logic, Composing Operations, Arithmetic)
6.3 Modeling Computing (Turing Machines)
6.4 Summary

Chapter 7: Cost
7.1 Empirical Measurements
7.2 Orders of Growth (Big O, Omega, Theta)
7.3 Analyzing Procedures (Input Size, Running Time, Worst Case Input)
7.4 Growth Rates (No Growth: Constant Time, Linear Growth, Quadratic Growth, Exponential Growth, Faster than Exponential Growth, Non-terminating Procedures)
7.5 Summary

Chapter 8: Sorting and Searching
8.1 Sorting (Best-First Sort, Insertion Sort, Quicker Sorting, Binary Trees, Quicksort)
8.2 Searching (Unstructured Search, Binary Search, Indexed Search)
8.3 Summary

Part III: Improving Expressiveness

Chapter 9: Mutation
9.1 Assignment
9.2 Impact of Mutation (Names, Places, Frames, and Environments; Evaluation Rules with State)
9.3 Mutable Pairs and Lists
9.4 Imperative Programming (List Mutators, Imperative Control Structures)
9.5 Summary

Chapter 10: Objects
10.1 Packaging Procedures and State (Encapsulation, Messages, Object Terminology)
10.2 Inheritance (Implementing Subclasses, Overriding Methods)
10.3 Object-Oriented Programming
10.4 Summary

Chapter 11: Interpreters
11.1 Python (Python Programs, Data Types, Applications and Invocations, Control Statements)
11.2 Parser
11.3 Evaluator (Primitives, If Expressions, Definitions and Names, Procedures, Application, Finishing the Interpreter)
11.4 Lazy Evaluation (Lazy Interpreter, Lazy Programming)
11.5 Summary
Part IV: The Limits of Computing

Chapter 12: Computability
12.1 Mechanizing Reasoning (Gödel's Incompleteness Theorem)
12.2 The Halting Problem
12.3 Universality
12.4 Proving Non-Computability
12.5 Summary

Indexes

附件: 您所在的用户组无法下载或查看附件


评分记录


好东西,但有点冷清!


返回列表

零点花园属于纯学术、非经营性专业网站。

大家出于学习和科研目的进行交流讨论,如有涉侵犯著作权人的版权等信息,请及时来信告知,我们将在3个工作日内做出相应的处理,并给予相应的答复,谢谢。

辽宁网警

辽宁网警