Predicatively computable functions on sets
classification
🧮 math.LO
keywords
computablefunctionsclasspredicativelybeckmannbinarybussfinite
read the original abstract
Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite binary strings.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.