Answers are grounded in this paper and cite their sources.
In this paper we give a recursion-theoretic characterization and a new machine model for the complexity class , the class of functions which are monotone. This is the first recursion-theoretic approach to a monotone/positive class of non-deterministic nature. The recursion scheme developed here has the potential to be applied to other monotone/positive classes based on non-deterministic models of computation. Moreover, the recursion-theoretic approach introduced in this work leads to a new machine model for mNP mNP of remarkable simplicity.
No takes yet. Share an insight, caveat, or question.
Oitavem et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: