HackerTube.dev

Stanford Seminar - Generalized Reversible Computing and the Unconventional Computing Landscape

Stanford Online · 15.5K views · 2017-10-19 · 1:10:03

Open on YouTube ↗

If playback is restricted in your region, try opening the original video. Use Mark watched to add it to your marked videos.

Overview

A Stanford EE380 seminar by Michael P. Frank of Sandia National Laboratories on generalized reversible computing. It surveys unconventional computing approaches as transistor scaling nears its limits and energy efficiency stops improving.

On Hacker News

HN commenters cite it as an informative talk from a leading researcher in reversible computing, mainly in threads on reversible computers and energy efficiency.

Recommended by 2 HN people across 2 months · HN mentions 2020–2021

Topics

Computer architecture & CPUsSemiconductors & chip manufacturing
Search by tags
reversible computingenergy efficiencyunconventional computingcmos limitsmichael frank

What people said

jonbaer · 2020-07 · Strong recommendation

I think Michael P Frank is one of the more knowledgable people working on the subject, his Stanford talk is extremely informative ... [VIDEO]

Read the original HN comment ↗
gbrown_ · 2021-02 · Recommendation

For anyone interested in the topic I highly recommend checking out Dr. Michael P. Frank's work. This video is good one to start with [VIDEO]

Read the original HN comment ↗
GiggleLiu · 2021-03 · Reference

According to [Michael Frank's video]( [VIDEO] ), there is an architectural overhead of ~500x that people can not get over (IIUC, this overhead only applies for gate based computing models). A reasonable gap between state-of-the-art gate based computing models and Landauer's limit should be 10^2-10^3. On the other side, reversible computing in general has 2-16 times computational overhead at the software level from my using experience. To save energy, reversible computing has to be at least ~10x more energy efficient at the instruction level.

Read the original HN comment ↗

Sources

Video by Stanford Online, played through YouTube.

Data and selection notes

HN summaries and labels may contain AI errors. HN dates refer to discussions, not video publication.

HN Library: HackerTube export (2026-10-31) and open-index/hacker-news. Upstream summaries and classifications may contain AI errors.

Views, duration and playback status refresh separately from the published catalog. When an update fails, existing data remains visible.

Selection checks
  • SaaS & AI candidates: Topic keywords do not match
  • Editor-approved picks: Editorial review is required

Rule matches identify candidates. They do not guarantee video quality or financial results.

About the library and its sources