Ivo Matijašević

Risk-Gated Mechanization: Severity, Verifiability, and Decisions Invariant to the Executor's Error Law

When should a step of agentic work be replaced by a deterministic mechanism? Earlier papers in this series answered with escape probabilities and costs, and treated every escaped fault as equally bad. We add severity and formalize a two-way principle, which reads informally as: m...

Beyond Constant Fault Rates: Reliability Bounds for Gated Computation and Semantic Mechanization

Constant fault intensity, independent segments, fresh retries, and a fixed fault distribution are different assumptions. Earlier papers on gated computation use different subsets of them. We separate these assumptions and examine which conclusions survive their removal. A conditi...

Progressive Semantic Mechanization: Compiling Intellectual Work into Deterministic Programs with Typed Semantic Holes

Which intellectual work should be an executor call (a call to a model or a person)? We model work as a program with typed semantic holes. Each site is open or closed separately for decision, production, and acceptance, and separately per input scope. Progressive semantic mechaniz...

Progressive Semantic Mechanization: Compiling Intellectual Work into Deterministic Programs with Typed Semantic Holes

Which intellectual work should be an executor call (a call to a model or a person)? We model work as a program with typed semantic holes. Each site is open or closed separately for decision, production, and acceptance, and separately per input scope. Progressive semantic mechaniz...