<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Transformers in Uniform TC$^0$ · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2409.13629/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2409.13629/feed.xml" rel="self" type="application/rss+xml" /><item><title>Transformers in Uniform TC$^0$ — mentioned by nyrikki</title><link>https://news.ycombinator.com/item?id=42496880</link><guid isPermaLink="false">urn:hackerpapers:mention:2409.13629:42496880</guid><pubDate>Mon, 23 Dec 2024 19:17:34 GMT</pubDate><description>&lt;p&gt;Yes, in this case PARITY is determining if the number of 1s in a binary input is odd or even It is an effect of the complex to unpack descriptive complexity class DLOGTIME-uniform TC0, which has AND, OR and MAJORITY gates. http://arxiv.org/abs/2409.13629 The point being that the ability to use parity gates is different than being able to calculate it, which is where the union of the typically ram machine DLOGTIME with the circuit complexity of uniform TC0 comes into play. PARITY, MAJ, AND, and OR are all symmetric, and are in TCO, but PARITY is not in DLOGTIME-uniform TC0, which is…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2409.13629/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CC</category></item></channel></rss>
