Computation with Backward Feedback: Power, Observation, and Cost
cs.CC
Submitted: 2026-11-12
Updated: 2026-11-12
Terminology
Sources
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?
- Computability Theory of Closed Timelike Curves
- Computation with narrow CTCs
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?