- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Introduction to Complex Automata using Cook Algebra
Abstract
As we have prior result of regular grammars over set of computational problems, we are to present the universal ‘complexity automata’ which can be used in solving any problem.Analytics
Added to PP
2025-04-16
Downloads
33 (#107,255)
6 months
33 (#104,931)
2025-04-16
Downloads
33 (#107,255)
6 months
33 (#104,931)
Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?
