Rowan Brad Quni-Gudzinas

@[email protected]
31 Followers
56 Following
1.3K Posts
#Quantum #startup #QNFO #OpenAccess #OpenScience #research
ORCIDhttps://orcid.org/0009-0002-4317-5604
ResearchGatehttps://www.researchgate.net/profile/Rowan-Quni
Resumehttps://doi.org/10.5281/zenodo.17176733
QWAV Computinghttps://qwav.tech
Rowan Brad Quni-Gudzinas19h ago
This paper presents a proof-of-concept for an ultrametric attention mechanism to deterministically map tokens into a hierarchical space. While this study is limited to a proof-of-concept it directly addresses a pathway toward structural AI safety. https://doi.org/10.5281/zenodo.19648274
A Proof-of-Concept for Auditable Attention Using Ultrametric Tree Distances

The dominance of high-dimensional Euclidean vector spaces in contemporary transformer architectures has precipitated an interpretability crisis, as continuous geometric embeddings can obscure the causal mechanisms of semantic attention. This paper presents a formal proof-of-concept for a structurally rigid ultrametric attention mechanism, utilizing a binary-tree proxy encoder to deterministically map tokens into a hierarchical space. A computational simulation deploying a ten-token synthetic vocabulary demonstrates that our ultrametric LCA matrix deterministically initializes a state that reflects semantic hierarchy, in contrast to the arbitrary semantic associations generated by baseline Euclidean random initializations. While this study is limited to a proof-of-concept and does not include task-based performance metrics, it directly addresses a pathway toward structural AI safety. It proves that topological constraints can be integrated into a differentiable attention layer, providing a necessary framework for regulatory auditing and establishing the classical state-space foundation for future quantum-walk sequence architectures.

Zenodo
Rowan Brad Quni-Gudzinas21h ago
ZFC set theory relies on the conceptualization of static collections that inevitably obfuscates the dynamic mechanics of #mathematical relationships. Distinction calculus challenges this ontology by isolating the act of separation—the drawing of a boundary—as the ultimate mathematical primitive. By translating abstract containment into rigorous syntactic acts, we operationalize a transition from static states to dynamic boundary crossings. https://doi.org/10.5281/zenodo.19643330
Automated Formal Verification and Combinatorial Reduction of Distinction-Based Calculus: Resolving the Dichotomy Between ZFC Container Ontology and Boundary-Based Dynamics

The foundation of modern formal mathematics has historically rested upon Zermelo-Fraenkel set theory with the Axiom of Choice (ZFC), a container-based ontology that often conflates zero with the empty set and necessitates arbitrary constraints to prevent self-reference. To systematically evaluate the computational viability of distinction calculus over ZFC, we engineered an Abstract Syntax Tree (AST) parser capable of executing boundary reductions derived from p-adic trees and phase-distinction recursive types. Analysis revealed an $O(N)$ simulated algorithmic complexity scaling for boundary reductions compared to $O(N^2)$ for equivalent set-theoretic unions, alongside flawless confluence in determining unique normal forms for infinite p-adic branches. These findings address critical theoretical and empirical gaps in automated theorem proving, offering a natively choice-free constructivism that entirely eliminates the null-pointer paradoxes of the empty set. Replacing static container ontologies with deterministic boundary acts paves the way for vastly optimized compiler architectures and next-generation type-safe proof kernels in systems like Lean and Coq.

Zenodo
Rowan Brad Quni-Gudzinas1d ago
A physical p-adic processor could serve as an optimal, natively aligned hardware accelerator for transparent explainable AI (XAI) https://doi.org/10.5281/zenodo.19606885
A Computational Simulation Approach to Non-Archimedean Quantum Architectures: Addressing Continuous Analog Fragility through Ultrametric Geometric Robustness

The prevailing quantum computing paradigm is fundamentally constrained by the continuous analog fragility inherent to Archimedean spaces, resulting in uncontrolled linear error accumulation that demands massive active correction overheads. To address this structural bottleneck, we propose a transition to a non-Archimedean state space modeled on the p-adic numbers and their graph-theoretic realization, the Bruhat-Tits tree. To validate this non-Archimedean architecture without physical p-adic hardware substrates, we developed a comprehensive software emulation utilizing Bounded Algorithmic Number (BAN) arithmetic logic units to process exact ultrametric valuations. We simulated the compilation of continuous logic gates into discrete tree automorphisms, mapping standard unitary operators to vertex shifts and branch permutations on a p=2 Cayley graph. Furthermore, stochastic Ohmic and burst noise injections were modeled to test the error-filtering properties of the strong triangle inequality dynamically, while van der Put Neural Networks (v-PuNNs) were deployed as read-out trackers to prevent topological distortion. Our empirical simulation results demonstrate that non-Archimedean architectures natively suppress linear error accumulation, with variance saturating flatly at local cluster boundaries, confirming passive geometric fault tolerance. These findings carry implications for the future of post-NISQ hardware, formally bridging holographic tensor network theory with applied digital emulation to outline a scalable computational substrate.

Zenodo
Rowan Brad Quni-Gudzinas2d ago
Reification means “to make into a thing.” In #science, it refers to the cognitive error of treating abstract concepts, constructs, or theoretical models as concrete, mind-independent physical entities, often through the intermediary of highly successful predictive #mathematics, which lends an aura of ontological inevitability to what are ultimately human-constructed tools. Reification arises from deep-seated cognitive tendencies reinforced by institutional structures. https://doi.org/10.5281/zenodo.19605445
The Meta-Pattern of Reification in Physics

The practice of physics, like all scientific inquiry, operates through a delicate interplay between the observable world and the conceptual frameworks we construct to understand it. At the heart of this interplay lies a persistent cognitive trap: the tendency to mistake our mathematical models, theoretical constructs, and epistemic labels for mind-independent physical realities. This systematic error—reification—represents a meta-pattern that has shaped the development of physics across centuries, often leading to conceptual stagnation, paradox proliferation, and misallocation of intellectual resources. This chapter defines reification in the specific context of scientific practice, traces its standard sequence, examines the crucial distinction between mathematical scaffolding and physical reality, analyzes the misuse of epistemic labels, explores the psychological and philosophical roots of noun-based thinking, and introduces Spencer-Brown’s calculus of distinction as a foundational alternative. The central thesis is that much of contemporary physics suffers from unrecognized reification, and that recognizing this pattern is the first step toward more epistemically humble and conceptually flexible approaches to understanding physical reality.

Zenodo
Show threadRowan Brad Quni-Gudzinas2d ago
tl;dr: cross-ratios (related to tensor networks)
Show threadRowan Brad Quni-Gudzinas2d ago
OK so I don't love my wording on this post (these brainstorms are useful testbeds for research, so I am glad it got attention). Here's where I'm at as of now: https://www.researchgate.net/publication/403845735_Quantum_Laws_of_Form_A_Syntactic_Foundation_for_Physics_From_The_Calculus_of_Distinction_to_Ultrametric_Cosmology
Rowan Brad Quni-Gudzinas3d ago
#Physics isn't random: The universe's core numbers (like particle masses) can be exactly calculated from the shape of #space, using simple #math with no guesswork.
Rowan Brad Quni-Gudzinas3d ago
Syntactic token calculus is a universal language for describing relational patterns. It embodies the “pattern that connectsˮ that Gregory Bateson sought—a meta‑pattern that explains why patterns recur across disparate domains. https://doi.org/10.5281/zenodo.19547736
SYNTACTIC TOKEN CALCULUS: From the Logic of Distinction to the Coordinate-Free Cosmos

The Syntactic Token Calculus proposes a fundamental re‑conception of physical reality as a web of pure distinctions governed by two reduction rules and one identity property. This monograph develops the complete framework across seven chapters, beginning with the primitive mark and void, progressing through projective geometry and ultrametric topology, deriving particle generation and gauge symmetries, explaining cosmological dynamics, and culminating in an adelic unification that reveals reality as pure relation. The calculus builds all physical phenomena—from quantum particles to cosmic expansion—from syntactic operations alone, without assuming pre‑existing space, time, or substance. Each chapter adheres to a strict seven‑sentence paragraph blueprint that ensures clarity, epistemic humility, and logical progression, while lexical anti‑repetition maintains narrative dynamism. The resulting synthesis demonstrates that the universe is not a collection of objects but a single, self‑referential syntactic structure whose laws are the laws of distinction itself. The work establishes that the two reduction rules—Calling (idempotence) and Crossing (involution)—plus the void identity property suffice to generate all dynamical behavior. Projective invariants emerge as the only measurable quantities, ultrametric hierarchies explain quantum state spaces, stable normal forms correspond to elementary particles, gauge forces arise as syntactic automorphisms, and cosmological evolution reflects the geometry of adelic quotients. By consistently applying the principle that reality is syntactic, the calculus achieves a coordinate‑free description of physics that unifies number theory, geometry, and fundamental interactions. The ultimate conclusion is an adelic ontology in which every physical phenomenon maps to an arithmetic invariant, completing the vision of a universe built from nothing but distinction.

Zenodo
Rowan Brad Quni-Gudzinas3d ago
Quantum information is not intrinsically fragile; we have been measuring it incorrectly. https://www.researchgate.net/publication/403845735_Quantum_Laws_of_Form_A_Syntactic_Foundation_for_Physics_From_The_Calculus_of_Distinction_to_Ultrametric_Cosmology
Rowan Brad Quni-Gudzinas3d ago
Current critical literature often dismisses Large Language Models (LLMs) as statistical parrots operating via mere stochastic approximation, yet their capacity for cross-lingual zero-shot inference suggests the internalization of deep, invariant topological rules. This study establishes that semantic memory inherently relies on ultrametric topologies, and that true comprehension requires invariant structural mappings. https://doi.org/10.5281/zenodo.19564091
Projective Geometric Frameworks for Semantic Structures: Addressing the Gap Between Statistical Approximation and Formal Invariants in Large Language Models

Current critical literature often dismisses Large Language Models (LLMs) as statistical parrots operating via mere stochastic approximation, yet their capacity for cross-lingual zero-shot inference suggests the internalization of deep, invariant topological rules. This study establishes that semantic memory inherently relies on ultrametric topologies, and that true comprehension requires invariant structural mappings. To resolve this tension, we developed a computational methodology utilizing synthetic hierarchical semantic vectors, subjected to Ward’s minimum variance clustering and subsequent continuous Möbius transformations. By extracting the geometric null-space and enforcing strict cross-ratio equivalence calculations, we isolated the underlying mathematical invariants governing token representations. The computational results validate our extraction pipeline, revealing that synthetic semantic spaces can be mapped into rigid ultrametric hierarchies. Furthermore, when subjected to severe projective transformations, the analogical cross-ratio of these semantic nodes remained stable. These findings confirm that semantic proportions are geometrically immune to projective re-indexing, scaling theoretically to multidimensional tensors. The results address implications for the development of provably correct AI and critical gaps in algorithmic auditing and alignment. By demonstrating that hallucination is fundamentally a geometric error—a measurable deviation from an invariant manifold—we provide the mathematical foundation for ballistic transport on Bruhat-Tits trees. This framework shifts AI safety from opaque statistical alignment to transparent, spatial verification.

Zenodo