Exact bounds on epsilon processes
Toshiyasu Arai
TL;DR
This paper demonstrates that the lengths of epsilon substitution processes can be precisely calculated using ordinal recursions, establishing an optimal method for such bounds.
Contribution
It introduces a method to compute exact bounds on epsilon processes using ordinal recursions, improving upon previous estimations.
Findings
Lengths are calculable by ordinal recursions
Bounds are optimal
Provides a new method for analyzing epsilon processes
Abstract
In this paper we show that the lengths of the approximating processes in epsilon substitution method are calculable by ordinal recursions in an optimal way.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · semigroups and automata theory · DNA and Biological Computing