
  <rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
    <channel>
      <title>Chaos and Order</title>
      <link>https://www.youngju.dev/blog</link>
      <description>천천히 올바르게. AI Researcher &amp; DevOps Engineer Youngju&#39;s tech blog. GPU/CUDA, LLM, MLOps, Kubernetes AI workloads, distributed training, and data engineering.</description>
      <language>ko</language>
      <managingEditor>fjvbn2003@gmail.com (Youngju Kim)</managingEditor>
      <webMaster>fjvbn2003@gmail.com (Youngju Kim)</webMaster>
      <lastBuildDate>Sat, 11 Jul 2026 00:00:00 GMT</lastBuildDate>
      <atom:link href="https://www.youngju.dev/tags/computation/feed.xml" rel="self" type="application/rss+xml"/>
      
  <item>
    <guid>https://www.youngju.dev/blog/2026-07-11-computation-universal-concept.en</guid>
    <title>Computation as a Universal Concept — What Holds Up and What Is Overclaimed</title>
    <link>https://www.youngju.dev/blog/2026-07-11-computation-universal-concept.en</link>
    <description>A short course titled &#39;Computation as a universal and fundamental concept,&#39; taught by Tim Roughgarden, has been trending. Read closely, it is careful computer-science theory: the halting problem, algorithmic efficiency, NP-completeness, and P versus NP. That gives the phrase a precise, defensible meaning. This post separates that solid core from the grander claim that the universe or the mind literally is computation, and asks where &#39;everything is computation&#39; stops making a falsifiable prediction.</description>
    <pubDate>Sat, 11 Jul 2026 00:00:00 GMT</pubDate>
    <author>fjvbn2003@gmail.com (Youngju Kim)</author>
    <category>computer-science</category><category>computation</category><category>complexity</category><category>theory</category><category>philosophy</category>
  </item>

  <item>
    <guid>https://www.youngju.dev/blog/2026-07-11-computation-universal-concept.ja</guid>
    <title>普遍的な概念としての計算 — 何が堅牢で、何が誇張なのか</title>
    <link>https://www.youngju.dev/blog/2026-07-11-computation-universal-concept.ja</link>
    <description>Tim Roughgardenが教える「普遍的で根本的な概念としての計算」という講義が話題です。実際の中身は、停止性問題、アルゴリズムの効率、NP完全性、そしてPとNPを扱う堅実な計算理論です。この記事は、その堅牢な核心と、宇宙や心が文字どおり計算だという、より大きな主張とを切り分け、「すべては計算だ」がどこから反証不可能な言葉になるのかを問います。</description>
    <pubDate>Sat, 11 Jul 2026 00:00:00 GMT</pubDate>
    <author>fjvbn2003@gmail.com (Youngju Kim)</author>
    <category>computer-science</category><category>computation</category><category>complexity</category><category>theory</category><category>philosophy</category>
  </item>

  <item>
    <guid>https://www.youngju.dev/blog/2026-07-11-computation-universal-concept</guid>
    <title>보편 개념으로서의 계산 — 무엇이 단단하고 무엇이 과장인가</title>
    <link>https://www.youngju.dev/blog/2026-07-11-computation-universal-concept</link>
    <description>Tim Roughgarden이 가르치는 &#39;보편적이고 근본적인 개념으로서의 계산&#39; 강의가 화제입니다. 실제 내용은 정지 문제, 알고리즘 효율, NP-완전성, 그리고 P 대 NP를 다루는 견실한 계산 이론입니다. 이 글은 그 단단한 핵심과, 우주나 마음이 문자 그대로 계산이라는 더 큰 주장을 구분하고, &#39;모든 것은 계산이다&#39;가 어디서부터 반증 불가능한 말이 되는지를 따집니다.</description>
    <pubDate>Sat, 11 Jul 2026 00:00:00 GMT</pubDate>
    <author>fjvbn2003@gmail.com (Youngju Kim)</author>
    <category>computer-science</category><category>computation</category><category>complexity</category><category>theory</category><category>philosophy</category>
  </item>

    </channel>
  </rss>
