可计算性与计算复杂性理论 Computability & complexity theory

计算理论：图灵机、停机问题、P vs NP、复杂度类、λ演算（lambda calculus）、自动机、Church-Turing 论题、哥德尔不完备定理与可计算性。

Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich

Confreaks

17 人推荐 · 跨 18 个月

28c3: The Science of Insecurity

28c3

9 人推荐 · 跨 9 个月

"Propositions as Types" by Philip Wadler

Strange Loop Conference

9 人推荐 · 跨 8 个月

Break Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas

Adrian Crenshaw

6 人推荐 · 跨 7 个月

Math's Fundamental Flaw

Veritasium

7 人推荐 · 跨 7 个月

On The Turing Completeness of PowerPoint (SIGBOVIK)

Tom Wildenhain

8 人推荐 · 跨 6 个月

Life in life

Phillip Bradbury

6 人推荐 · 跨 6 个月

Lambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScript

Fullstack Academy

5 人推荐 · 跨 5 个月

All the Numbers - Numberphile

Numberphile

6 人推荐 · 跨 6 个月

P vs. NP and the Computational Complexity Zoo

hackerdashery

4 人推荐 · 跨 5 个月

Ruby Manor 3 - Programming with Nothing by Tom Stuart

Confreaks

4 人推荐 · 跨 4 个月

David Beazley - Lambda Calculus from the Ground Up - PyCon 2019

PyCon 2019

4 人推荐 · 跨 4 个月

Great Impractical Ideas in Computer Science: PowerPoint Programming

Tom Wildenhain

4 人推荐 · 跨 4 个月