Accepting Subset States in Neural Networks Optimization

11 July 2026, Version 1
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

We are to present an intuitive and basic approach towards the optimization of neural networks according to determinism theory which was basically abstracted by Rabin-Scott’s subset construction, our practical method shows the prolonged advancement in neural networks simulation using this proof according to the underlying optimization, speed-up or heuristics

Keywords

artificial neural networks
optimization
subset construction
determinism
automata theory

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.