<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0">
    <channel>
      <title>Octocurious</title>
      <link>https://octocurious.com</link>
      <description>Last 10 notes on Octocurious</description>
      <generator>Quartz -- quartz.jzhao.xyz</generator>
      <item>
    <title>Recursively Enumerable Language</title>
    <link>https://octocurious.com/Recursively-Enumerable-Language</link>
    <guid>https://octocurious.com/Recursively-Enumerable-Language</guid>
    <description><![CDATA[ Definition A formal language L is recursively enumerable (or Turing-recognizable) if there exists a Turing machine M such that: If w∈L, M halts and accepts w. ]]></description>
    <pubDate>Wed, 17 Jun 2026 00:00:56 GMT</pubDate>
  </item><item>
    <title>Mathematical Logic</title>
    <link>https://octocurious.com/ref/kleene1967-logic</link>
    <guid>https://octocurious.com/ref/kleene1967-logic</guid>
    <description><![CDATA[ Abstract An introduction to mathematical logic covering propositional logic, Predicate Logic, and foundations of mathematics. ]]></description>
    <pubDate>Tue, 16 Jun 2026 23:59:51 GMT</pubDate>
  </item><item>
    <title>Quantum Computing</title>
    <link>https://octocurious.com/Quantum-Computing</link>
    <guid>https://octocurious.com/Quantum-Computing</guid>
    <description><![CDATA[ Overview Run on superconducting circuits that require very low temperature to work. ]]></description>
    <pubDate>Tue, 16 Jun 2026 23:57:46 GMT</pubDate>
  </item><item>
    <title>Machine Learning</title>
    <link>https://octocurious.com/Machine-Learning</link>
    <guid>https://octocurious.com/Machine-Learning</guid>
    <description><![CDATA[ Machine learning is a class of methods for building algorithms which rely on a collection of examples of some phenomenon. ]]></description>
    <pubDate>Tue, 16 Jun 2026 23:57:07 GMT</pubDate>
  </item><item>
    <title>Universe</title>
    <link>https://octocurious.com/Universe</link>
    <guid>https://octocurious.com/Universe</guid>
    <description><![CDATA[ Definition In type theory, a universe is a type whose terms are themselves types. We typically denote a universe by U or Type. ]]></description>
    <pubDate>Tue, 16 Jun 2026 23:42:27 GMT</pubDate>
  </item><item>
    <title>Weakly-Initial Set of Covers</title>
    <link>https://octocurious.com/Weakly-Initial-Set-of-Covers</link>
    <guid>https://octocurious.com/Weakly-Initial-Set-of-Covers</guid>
    <description><![CDATA[ Transclude of Cover-of-a-Set#definition Transclude of Category-of-Covers#definition Transclude of Weakly-Initial-Set#definition Definition A weakly initial set of covers over Y is just a weakly initial set in the category of covers Cov(Y). ]]></description>
    <pubDate>Tue, 16 Jun 2026 13:41:54 GMT</pubDate>
  </item><item>
    <title>Quotient Inductive-Inductive Types</title>
    <link>https://octocurious.com/ref/altenkirch2016-qiit</link>
    <guid>https://octocurious.com/ref/altenkirch2016-qiit</guid>
    <description><![CDATA[ Abstract Higher inductive types (HITs) in Homotopy Type Theory (HoTT) allow the definition of datatypes which have constructors for equalities over the defined type. ]]></description>
    <pubDate>Mon, 15 Jun 2026 00:03:29 GMT</pubDate>
  </item><item>
    <title>Product (Category Theory)</title>
    <link>https://octocurious.com/Product-(Category-Theory)</link>
    <guid>https://octocurious.com/Product-(Category-Theory)</guid>
    <description><![CDATA[ Definition In category theory, a product is a limit of a discrete diagram. ]]></description>
    <pubDate>Sun, 14 Jun 2026 23:47:57 GMT</pubDate>
  </item><item>
    <title>Ab (Category)</title>
    <link>https://octocurious.com/Ab-(Category)</link>
    <guid>https://octocurious.com/Ab-(Category)</guid>
    <description><![CDATA[ Definition Ab is the Category of Abelian groups and group homomorphisms. ]]></description>
    <pubDate>Sun, 14 Jun 2026 23:27:30 GMT</pubDate>
  </item><item>
    <title>Abelian monoid</title>
    <link>https://octocurious.com/Abelian-monoid</link>
    <guid>https://octocurious.com/Abelian-monoid</guid>
    <description><![CDATA[ An Abelian monoid or commutative monoid is a monoid (A,∗) where ∗ is commutative. ]]></description>
    <pubDate>Sun, 14 Jun 2026 23:24:26 GMT</pubDate>
  </item>
    </channel>
  </rss>