Three new robust error models for catalytic tape resetting are characterized with equivalences to standard classes and collapse under derandomization.
Savitch , title =
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
verdicts
UNVERDICTED 5representative citing papers
The optimal value and policy computation problem for finite-horizon objectives in multi-environment POMDPs is PSPACE-complete, and a new algorithm solves it more efficiently than previous methods on classical benchmarks.
Reachability in priority-inhibitory CRNs is mostly in P for deletion-only systems but NP-complete in one case; in inhibitory CRNs it is mostly NP-complete for deletion-only and PSPACE-complete even for (1,1)-size reactions.
GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.
The brain acts as a homology engine that minimizes topological complexity to convert high-entropy sensory flux into low-entropy invariant cognitive structure via parity between scaffolds and flows.
citing papers explorer
-
Understanding Robust Catalytic Computing
Three new robust error models for catalytic tape resetting are characterized with equivalences to standard classes and collapse under derandomization.
-
Multi-Environment POMDPs with Finite-Horizon Objectives
The optimal value and policy computation problem for finite-horizon objectives in multi-environment POMDPs is PSPACE-complete, and a new algorithm solves it more efficiently than previous methods on classical benchmarks.
-
Reachability with Restricted Reactions in Inhibitory Chemical Reaction Networks
Reachability in priority-inhibitory CRNs is mostly in P for deletion-only systems but NP-complete in one case; in inhibitory CRNs it is mostly NP-complete for deletion-only and PSPACE-complete even for (1,1)-size reactions.
-
Guarded Negation Transitive Closure Logic
GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.
-
The Homological Brain: Parity Principle and Amortized Inference
The brain acts as a homology engine that minimizes topological complexity to convert high-entropy sensory flux into low-entropy invariant cognitive structure via parity between scaffolds and flows.