<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Physical-Law on CS Theorems</title><link>https://cs.lozic.me/kinds/physical-law/</link><description>Recent content in Physical-Law on CS Theorems</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 02 Jul 2027 12:00:00 +0100</lastBuildDate><atom:link href="https://cs.lozic.me/kinds/physical-law/index.xml" rel="self" type="application/rss+xml"/><item><title>The No-Cloning Theorem</title><link>https://cs.lozic.me/posts/t110-the-no-cloning-theorem/</link><pubDate>Fri, 02 Jul 2027 12:00:00 +0100</pubDate><guid>https://cs.lozic.me/posts/t110-the-no-cloning-theorem/</guid><description>&lt;h2 id="symptom"&gt;Symptom&lt;/h2&gt;
&lt;p&gt;You have spent this whole part learning that information wants to be copied.
Entropy bounds compression (T018), Huffman hits the bound (T020), redundancy
buys error correction (T021). Every result so far treats &amp;ldquo;make another copy&amp;rdquo; as
the free operation — the thing you do without thinking, the reason &lt;code&gt;cp&lt;/code&gt; has no
interesting failure modes.&lt;/p&gt;</description></item></channel></rss>