Abed Kadaan

Computational Substrate Scientist and Principal Researcher

Abed Kadaan formulated the research program of Computational Grammar Theory (CGT) and its founding question: whether the grammar of a computational structure — the formal rules saying which operations are admissible, how they compose and what they mean — can become part of the machinery that computes over the structure, rather than remaining a description of it.

Origin of the question

The question emerged from Kadaan’s work on systems in which an address does more than locate something:

These are the historical and conceptual motivations of the program. They are not mathematical evidence, and nothing in the book depends on them: CGT stands on its own definitions, proofs, experiments and counterexamples. Readers do not need to know the antecedent systems to read the book.

Contributions and provenance

The research program, its originating conjecture, and the research mandates that govern its conduct are Kadaan’s. The formalization, implementation, literature review and proof development in the current edition were carried out with AI assistance (Claude, Anthropic), under those mandates. The provenance record classifies every definition and result by origin — Kadaan’s conjectures, definitions introduced during the investigation, results proved here, results known from the literature, empirical findings, open questions, and rejected hypotheses.

Status

This book and its software are a research program in progress. They have not been peer reviewed, and no university appointment, institutional affiliation, external endorsement or independent verification is claimed. Results marked “proved here” have been checked by their authors and, where possible, by exhaustive computation; they await independent review. See publication status.

The research agency

Under the name Abed Kadaan, the broader research activity — CGT, its publications, consulting on the analysis of computational structures, and future applications — is conducted as an independent research agency. Its positioning follows the demonstrated results of this book: the analysis of representations, admissibility constraints and cost accounting for real algorithms (the PageRank case study of Part V is an example of the kind of analysis offered). No client engagements, deployments or endorsements are implied by this page.

Engaging with the research

The most useful contributions at this stage are independent checks of the proofs marked “proved here”, literature pointers that establish or refute the novelty of a candidate contribution (see the open problems), and reproductions of the experiments on other machines. Everything needed is in the repository.