Algebras for Deterministic Computation Are Inherently Incomplete

2024-11-21

Proceedings of the ACM on Programming Languages

AI Summary

This paper investigates whether deterministic computation can be fully characterized by a finite algebraic system analogous to Kleene Algebra with Tests (KAT). Specifically, it addresses whether the deterministic fragment of KAT admits a finite set of control-flow operations sufficient to generate all deterministic finite-state computations. Method: Drawing on formal language theory, algebraic semantics, regular algebra, and model-theoretic techniques, the authors rigorously analyze the expressive limitations of finite algebraic signatures over deterministic automata. Contribution/Results: The paper establishes, for the first time, that no finite set of control-flow primitives can axiomatize the entire class of deterministic finite-state computations—thereby refuting the existence of a KAT-style complete algebraic framework for determinism. This result demonstrates an intrinsic incompleteness in the algebraic characterization of deterministic computation and reveals a fundamental expressiveness boundary of classical control structures (sequence, conditionals, loops), advancing foundational understanding of computational representability in program algebras.

Technology Category

• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Planning, Routing, and Scheduling: Deterministic Planning
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories

Application Category

• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments

Abstract

Kleene Algebra with Tests (KAT) provides an elegant algebraic framework for describing non-deterministic finite-state computations. Using a small finite set of non-deterministic programming constructs (sequencing, non-deterministic choice, and iteration) it is able to express all non-deterministic finite state control flow over a finite set of primitives. It is natural to ask whether there exists a similar finite set of constructs that can capture all deterministic computation. We show that this is not the case. More precisely, the deterministic fragment of KAT is not generated by any finite set of regular control flow operations. This generalizes earlier results about the expressivity of the traditional control flow operations, i.e., sequential composition, if-then-else and while.

Problem

• Deterministic Computation
• Kleene Algebra with Tests (KAT)
• Computational Representation

Innovation

• Deterministic Computation
• Algebraic Representation
• Fundamental Limitations