真实讨论 · 值得阅读English

Turing

了解 Christos H. Papadimitriou 的《Turing》(Turing):2007-02-22–2026-11-01 的 Hacker News 数据中有 4 次提及、3 位讨论者。阅读原文摘录、比较不同观点,将它加入你的书单。

THE HACKERBOOKS LIBRARY
Turing
Christos H. Papadimitriou
文学与科幻

Turing

4 次提及 · 3 位讨论者 · 2 位推荐者

图书版本信息

社区里的声音

最近 4 条来源记录

提及不等于推荐。标签来自源数据的自动分类;请打开原始讨论核对上下文。

Ccodeulike
推荐 · 来源标签

此记录保留了作者、时间和来源链接,请打开 HN 阅读完整上下文。

在 Hacker News 阅读原文
Aandrewcooke
批评 · 来源标签

此记录保留了作者、时间和来源链接,请打开 HN 阅读完整上下文。

在 Hacker News 阅读原文
Rrw
推荐 · 来源标签

…ntaining ~700 exercises on proving various properties of algorithms. And it teaches you most of what is needed. Download it from: http://www.eng.unt.edu/ian/books/free/ "Elements of the Theory of Computation" (Papadimitriou): Classic text. Sure you've heard of Turing machines before, but what do you know about mu-recursive functions? It's very beautiful and if you have a person with whom to read the book and do the exercises, you will gain immensely. It will help unify, in your mind, many of the myriad articles you've probably read on Wikipedia about formal languages and complexity theory.

在 Hacker News 阅读原文
Rrw
推荐 · 来源标签

…ntaining ~700 exercises on proving various properties of algorithms. And it teaches you most of what is needed. Download it from: http://www.eng.unt.edu/ian/books/free/ "Elements of the Theory of Computation" (Papadimitriou): Classic text. Sure you've heard of Turing machines before, but what do you know about mu-recursive functions? It's very beautiful and if you have a person with whom to read the book and do the exercises, you will gain immensely.

在 Hacker News 阅读原文