<?xml version="1.0" encoding="UTF-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
  <title>e-sygoing.link — Computability</title>
  <link>https://e-sygoing.link</link>
  <description>Latest links in the Computability category</description>
  <language>en-us</language>
  <lastBuildDate>Sun, 24 May 2026 09:07:12 -0400</lastBuildDate>
  <atom:link href="https://e-sygoing.link/rss.php?type=new&amp;cid=61698"
             rel="self" type="application/rss+xml"/>
    <item>
    <title>Hypercomputation Research Network</title>
    <link>https://e-sygoing.link/link/5285578-hypercomputation-research-network</link>
    <description>The study of computation beyond that defined by the Turing machine, also known as super-Turing, non-standard or non-recursive computation.  Links to people, resources and discussions.</description>
    <pubDate>Sun, 03 May 2026 22:00:17 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5285578</guid>
  </item>
    <item>
    <title>Interactive Computation</title>
    <link>https://e-sygoing.link/link/5285582-interactive-computation</link>
    <description>Wikipedia article.</description>
    <pubDate>Wed, 19 Nov 2025 22:27:20 -0500</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5285582</guid>
  </item>
    <item>
    <title>Open Questions in Recursion Theory</title>
    <link>https://e-sygoing.link/link/5285584-open-questions-in-recursion-theory</link>
    <description>Compiled by Theodore A. Slaman, Berkeley [TeX/PDF].</description>
    <pubDate>Sun, 08 Jun 2025 21:54:14 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5285584</guid>
  </item>
    <item>
    <title>Church-Turing Thesis</title>
    <link>https://e-sygoing.link/link/5285579-church-turing-thesis</link>
    <description>Alonzo Church and Alan Turing formulated the thesis that computability coincides with recursivity; by Jack Copeland.</description>
    <pubDate>Sun, 15 Dec 2024 23:04:18 -0500</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5285579</guid>
  </item>
    <item>
    <title>ECCC - Electronic Colloquium on Computational Complexity</title>
    <link>https://e-sygoing.link/link/5285573-eccc-electronic-colloquium-on-computational-complexity</link>
    <description>The Electronic Colloquium on Computational Complexity is a new forum for the rapid and  widespread interchange of ideas, techniques, and research in computational complexity. The Electronic Colloquium on Computational Complexity  (ECCC) welcomes papers, short notes and surveys with relevance to the theory of computation</description>
    <pubDate>Fri, 27 Sep 2024 21:58:15 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5285573</guid>
  </item>
    <item>
    <title>Computability and Complexity</title>
    <link>https://e-sygoing.link/link/5285576-computability-and-complexity</link>
    <description>An online course on complexity.</description>
    <pubDate>Wed, 25 Sep 2024 18:45:36 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5285576</guid>
  </item>
    <item>
    <title>Computability and Complexity in Analysis Network</title>
    <link>https://e-sygoing.link/link/5285585-computability-and-complexity-in-analysis-network</link>
    <description>The CCA Network provides some useful information for researchers working in the field of computability and complexity in analysis.</description>
    <pubDate>Fri, 12 Apr 2024 14:49:04 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5285585</guid>
  </item>
    <item>
    <title>Introduction to Logic and Recursion Theory</title>
    <link>https://e-sygoing.link/link/5285580-introduction-to-logic-and-recursion-theory</link>
    <description>Notes from the class taught by Prof. Sacks in the Spring of 1998.</description>
    <pubDate>Sat, 18 Nov 2023 07:48:31 -0500</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5285580</guid>
  </item>
  </channel>
</rss>
