2015 article on #Landauer’s Principle with an overview of the history. #reversible #computability
on 02016-10-03from 2012: “Computing’s Power Limit Demonstrated.” or “#Landauer limit demonstrated” by Eric Lutz confining 2-μm glass beads in water with optical tweezers, published in nature. #reversible #computability
on 02016-10-03“Fundamental limits of energy dissipation in charge-based computing” #paper on #Landauer’s principle reporting experimental results that show that #reversible electrical #hardware can dissipate sub-Landauer quantities of energy. #computability
on 02016-10-03#physics #PDF #paper by John D. Norton questioning #Landauer’s principle. #reversible #computability
on 02016-10-03A bunch of stuff I don’t understand about #logic and #computability in the context of competing AI agents that are able to examine each other’s code and compute things about it. Refers to a bunch of SIAI stuff like “Kripke frames” and “modal combat” that I know nothing about, as well as stuff like Löb’s Theorem that I know a little bit about.
on 02016-09-23Dan Piponi explains why #computability (of “codata”) entails continuity
on 02016-06-28This Hao Wang guy invented Wang tiles, which are pretty much the simplest computational model, and also a four-instruction Turing-complete machine called the “Wang B-machine”. #computability #history
on 02016-05-26#computability and the Busy Beaver numbers; the Metamath folks are finding smaller and smaller Turing machines that only halt if ZF set theory is inconsistent. Stefan O’Rear has an entry with 1919 states, indicating that BB(1919) is uncomputable using ZF set theory, since it can’t prove its own consistency.
on 02016-05-22“Adam Yedidia, a PhD student at MIT (but an MEng student when he did most of this work), has explicitly constructed a one-tape, two-symbol Turing machine with 7,918 states, whose behavior (when run on a blank tape) can never be proven from the usual axioms of set theory, under reasonable consistency hypotheses,” bearing somewhat on the question of #abiogenesis. This post includes a short #tutorial on #computability and Busy Beaver numbers. #cs
on 02016-05-04Terry #Tao’s "finite time blowup" #paper about universal #computability with the #Navier-Stokes equation. Using quadratic logic gates and turbulence.
on 02015-08-19discussion of Terry #Tao’s paper about universal #computability with the #Navier-Stokes equation, #finite-time-blowup.
on 02015-08-19The #philosophy of #computer-science, including semantics, ontology, correctness, abstraction, #computability, etc.
on 02015-08-05#Interview with Scott Aaronson by Luke Muehlhauser about quantum physics, philosophy, #computability and #complexity, and so on. #toread
on 02015-08-05