Stochastic Process Semantics for Dynamical Grammar Syntax: An Overview
Eric Mjolsness
Abstract
We define a class of probabilistic models in terms of an operator algebra of stochastic processes, and a representation for this class in terms of stochastic parameterized grammars. A syntactic specification of a grammar is mapped to semantics given in terms of a ring of operators, so that grammatical composition corresponds to operator addition or multiplication. The operators are generators for the time-evolution of stochastic processes. Within this modeling framework one can express data clustering models, logic programs, ordinary and stochastic differential equations, graph grammars, and stochastic chemical reaction kinetics. This mathematical formulation connects these apparently distant fields to one another and to mathematical methods from quantum field theory and operator algebra.
Create a lesson
Related papers
AesCode: Aesthetic Code Generation with Decoupled Cross-Modal Rewards
Xin Gao, Yifan Yang, Xin Li et al.
MFG: Multi-turn Feedback Guided Molecular Optimization
Trieu Nguyen, Frazier N. Baker, Ruoxi Gao et al.
Who Improves the Robot? Toward Physical Recursive Self-Improvement
Hai Zhou, Fan Yang, Zeyi Chen et al.
Read the Room Before Your Model Generates
Muyao Kong, Zhihao Lin
Self-Evolving Agent Harness
Chuyang Wei, Haoxiang Guan, Minghang Zhu et al.
Pack Light, CarryOn: Building Object-Oriented Context for Long-Horizon Agents
Yuchen Lu, Julian McAuley, Lei Zhang