{'fraction_non_alphanumeric': 0.029159519725557463, 'fraction_numerical': 0.00686106346483705, 'mean_word_length': 4.835, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
The Eventual C-Element Theorem for Delay-Insensitive Asynchronous Circuits

In a seminal 1990 paper [9], Martin presents the C-element Theorem which implies, roughly, that the class of purely delay insensitive (DI) circuits is fundamentally limited in the set of functions it can implement. We provide circuit examples, both DI and not DI, that violate assumptions or results from [9], showing that the set of circuits considered by [9] is more limited than one might expect—and hence, the results from [9] are weaker than previously thought. In this paper we address this issue and amend matters. We use a model of circuits that naturally captures DI properties, and in particular admits all of our circuit examples. We prove the Eventual C-element Theorem for DI circuits. This is a variant of the C-element Theorem that similarly implies that the class of DI circuits is very limited. The proof of the new theorem uses novel techniques, and in particular makes use of a combinatorial property not present in previous work. With the new result, Martins original insight and its profound implications are restored and provided with a new mathematical justification.