Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Preprint
Data sources: ZENODO
addClaim

Morphic Inner World: A Substrate-Independent Deterministic Symbolic Core

Authors: Miyata, Fumio;

Morphic Inner World: A Substrate-Independent Deterministic Symbolic Core

Abstract

Morphic Inner World: A Substrate-Independent Deterministic Symbolic Core This repository contains the complete source code, benchmark suite, execution logs, and supplementary materials for the paper "Morphic Inner World: A Substrate-Independent Deterministic Symbolic Core". MIW is a deterministic symbolic architecture that models reasoning as a structure-preserving projection from natural language into a free term algebra. It uses a strategic longest-match tokenizer, a fixed dictionary of 44 Morphic Primitives, and a decoupled Wisdom Base (WB) to achieve: Complete language invariance between English and Japanese task specifications Platform invariance with bit-identical results across Python and Modern Fortran kernels 100.0% deterministic correctness on a 60-task benchmark suite constructed for this study Key Features Fully deterministic term-rewriting system with guaranteed termination and confluence Substrate-independent design via the Wisdom Base (WB) Clear execution traces and immutable DAG structure for verifiable reasoning Deterministic error handling (never crashes, returns VError objects) Contents Python and Modern Fortran implementations Full 60-task benchmark suite with execution logs All figures and supplementary materials Dockerfile and setup instructions for reproducibility All experiments are fully reproducible. The benchmark is designed as a validation set to exercise the 44 primitives and their compositions, not as a general-purpose benchmark.

Powered by OpenAIRE graph
Found an issue? Give us feedback