Concrete maths reading notes 1 - ch. 1&2

saintony

于 2013-11-11 00:51:03 发布

阅读量773

点赞数

分类专栏： Basics & Theories

本文链接：https://blog.csdn.net/saintony/article/details/15027559

版权

Basics & Theories 专栏收录该内容

46 篇文章

订阅专栏

作者分享了初次阅读《混凝土数学》的感受，这本书以其易于理解的内容和寓教于乐的方式，让读者在阅读中不仅获得了数学知识，还体验到了计算机科学与数学之间的紧密联系。通过实例分析，如从简单案例开始寻找模式的方法，以及如何将算法转换为Turing机语言的过程，本书成功地将复杂概念简化，并激发了作者对数学和计算机科学的进一步兴趣。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

I got my current copy of concrete maths about four years ago in Shanghai. And now I finally possess the courage and determination to read it. What surprised me is that this book is so accessible and fun for reading. Sometimes I even imagine that if I read it in high school, i could apply “applied maths" as my prime major in college. Chapter 1 starts with recurrent problems which is a major concept in cs courses.

First half of chapter 1 "Recurrent problems" gives you a very important interview skill: "start from simple cases" and try to find a pattern out of it - this is what I learnt from "Programming Interviews Exposed". It works very well. But this is a maths book so generalization method is introduced and also applied to Josephus problem. This is the best texts that connects computer science with mathematics. It reminds me a wonderful part in Sipser's in which how an algorithm is decoded to a Turing machine's language.

Chapter 2 handles all kinds of SUMs. I never knew there are so many interesting facts about SUM - which I considered to be intuitive and not very brain demanding.

So far, nothing is out of knowledge of early years of undergrad. But it is simply fun and amazing.