Manuel Blum
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
no series more than once — all 7 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| The Conscious Turing Machine (CTM), a formally defined Theoretical model of Consciousness | The Role of TCS in Modern Machine Learning | 2026-05-26 |
A formally specified Conscious Turing Machine is given as a 7‑tuple with roughly 10 million processors, a 10‑Hz clock, STM/LTM, an up‑tree competition and… | ||
| What is Consciousness and Can Machines have it? Part 2 | Smale@95: A Conference in Honor of Steve Smale | 2025-07-21 |
Argues that phenomenal consciousness can emerge from deterministic classical physics and sketches a formal model called the Conscious Turing Machine as a… | ||
| On the Hard Problem of Pain | Understanding Higher-Level Intelligence from AI, Psychology, and Neuroscience Perspectives | 2024-06-24 |
Argues that agony requires two specific mechanisms: two generators of pain — a global broadcast that forces processors to interrupt tasks (attention) and a… | ||
| Towards a Conscious AI | Berkeley ACM A.M. Turing Laureate Colloquium 2018 | 2018-09-26 |
Proposes a formal “Conscious Turing Machine” architecture inspired by Baars’s global workspace: sensory inputs go to many specialized processors, whatever… | ||
| Cal Day Lecture: Can a Machine be Conscious? Towards a Conscious AI | Computational Theories of the Brain 2018 | 2018-04-16 |
Defines a Conscious Turing Machine whose tiny short-term memory broadcast sends a single small “stage” to ~10^11 unconscious processors; each processor… | ||
| Human Computation | KARPfest80 | 2015-10-17 |
A live demo builds and tests human‑computable password schemas that transform site names into passwords by combining a memorized telephone number with a… | ||
| Human Computation | Connections Between Algorithm Design and Complexity Theory | 2015-09-28 |
Defines formal “humanly computable” algorithms with tight time budgets: preprocessing up to two hours, generation ≤60s (preferably 30s), and step costs… | ||
| nothing matches | ||