Published December 22, 2025 | Version v1.0
Preprint Open

From Abandoned Determinism to Computational Law: Why Modern AI Governance Fails at Execution-Time

Authors/Creators

  • 1. IAMMOGO Intelligence Company, Inc.

Description

Modern artificial intelligence systems increasingly operate in domains with real-world consequences, yet their governance mechanisms remain fundamentally post-hoc. This paper examines the structural limitations of probabilistic AI systems with respect to execution-time authority and explains why monitoring, auditing, and explainability cannot constitute governance when applied after execution has already occurred.

The paper traces the historical shift from deterministic computing systems—characterized by explicit state transitions and provable correctness—to probabilistic, scale-driven architectures where execution precedes validation. It introduces computational law as a governing principle and presents Deterministic AI Operating Systems (DAIOS) as an architectural application that restores execution-time governance through deterministic constraint enforcement at boot and state transition.

This work is theoretical and architectural in scope. It does not evaluate model performance, propose algorithms, or critique specific organizations. It establishes execution ordering as a prerequisite for trustworthy AI in safety-critical, regulated, and sovereign environments.

Files

From_Abandoned_Determinism_to_Computational_Law.pdf

Files (246.2 kB)

Additional details

Identifiers

Other
US Non-Provisional Patent Application No. 19/400,020

Related works

Is supplemented by
Preprint: 10.5281/zenodo.18013407 (DOI)
Preprint: 10.5281/zenodo.17826047 (DOI)
Preprint: 10.5281/zenodo.17786898 (DOI)

Dates

Issued
2025-12-22

References

  • Turing, A. M. (1936). On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42(2), 230–265.
  • Hopcroft, J. E., & Ullman, J. D. (1979). Introduction to automata theory, languages, and computation. Addison-Wesley.
  • Lamport, L. (1978). Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7), 558–565.
  • Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2012). ImageNet classification with deep convolutional neural networks. Advances in Neural Information Processing Systems, 25.
  • Bender, E. M., Gebru, T., McMillan-Major, A., & Shmitchell, S. (2021). On the dangers of stochastic parrots: Can language models be too big? Proceedings of the ACM Conference on Fairness, Accountability, and Transparency.
  • Klein, G., Elphinstone, K., Heiser, G., et al. (2009). seL4: Formal verification of an OS kernel. Proceedings of the ACM SIGOPS Symposium on Operating Systems Principles.
  • Gough, T. M. (2025). The incompatibility of probabilistic inference and authority: Why AI systems that guess cannot be trusted with decisions (Version 1.0). Zenodo. https://doi.org/10.5281/zenodo.18013407
  • Gough, T. M. (2025). A universal framework for ethical machine and human decision systems: Deterministic ethics-constrained state transition law (Version 1.0). Zenodo. https://doi.org/10.5281/zenodo.17826047
  • Gough, T. M. (2025). The deterministic unification model: Completing AI theory through state-transition computation (Version 1.0). Zenodo. https://doi.org/10.5281/zenodo.17786898