Year: 2026
Type: article
Abstract: 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 $$\texttt {mNP}$$ mNP of remarkable simplicity.
Source: Archive for Mathematical Logic
Authors: Isabel Oitavem, Eduardo Skapinakis
Institutions: Universidade Nova de Lisboa, University of Tübingen
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,190
OpenAlex ID: W7225347659