Home About Theory Prime Numbers P Laboratory Contact

An Open Laboratory on Grammatical Computation

This site documents research on the P System, a framework based on the hypothesis of a grammatical origin of prime numbers. The goal is to explore an alternative computational paradigm, making the theory and implementations accessible for verification and scientific debate.

The research is structured around a rigorous theoretical foundation, validated by computational experiments, and a series of exploratory applications in various domains. The main sections of this laboratory are Theory, the study of Prime Numbers, and practical implementations.

Framework Features

π₁

Prime Number Generation

The system identifies prime numbers through grammatical saturation processes, where indivisibility emerges as an intrinsic structural property of the formal language.

Symbolic Computation

Computational operations are implemented as grammatical transformations, offering an alternative paradigm to traditional binary logic.

Complex Systems Modeling

The framework enables simulation of physical and biological phenomena through the application of grammatical rules to symbolic structures.

ω

Emergent Properties

The system manifests complex behaviors arising from the interaction of simple grammatical rules, suggesting applications in artificial intelligence.

χ

Generative Capabilities

The grammatical structure allows autonomous generation of new symbolic configurations through iterative transformation processes.

φ

Interdisciplinary Applications

The framework finds application in various scientific fields, from number theory to theoretical physics, from cryptography to computational biology.

Experimental Model Validation

The framework's validity has been tested through the Selective Genealogical Algorithm (SGA), a constructive engine that translates theory into computational implementation. The main results demonstrate:

10¹² Computational limit reached
28 min Time to compute up to 10¹²
O(N log log N) Near-linear scalability
100% Correspondence with π(x)

The Rust implementation of the SGA correctly calculated the 37,607,912,018 prime numbers up to 10¹², empirically validating the theoretical model's consistency and efficiency. The SGA is a generative process that does not rely on factorization.

Research Areas in the P Laboratory

Fundamental Studies

Performance analysis of the Selective Genealogical Algorithm (SGA) and study of the Morphogenetic Signature (φ) as a metric of the structural quality of numbers.

Symmetric Cryptography

Development of the P-Signature scheme, which uses the Morphogenetic Signature as part of the key generation and encoding process.

Complex Systems Modeling

Exploratory application of P System grammar to describe particle physics phenomena and dynamic systems as emergent symbolic structures.

Grammatical Intelligence and OS

Long-term research on AI models based on grammatical coherence and the SyntaxOS project, an experimental operating system based on the non-binary grammar of the P System.