Predicatively computable functions on sets

TL;DR

This paper introduces a class of set-theoretic functions called predicatively computable functions, which are polynomial time computable on finite binary strings, inspired by prior work in the field.

Contribution

It defines a new class of functions within set theory that are computationally feasible, extending the understanding of predicative computation.

Findings

Functions are polynomial time computable on finite binary strings.

The class is inspired by and related to previous work by Beckmann, Buss, and Friedman.

Provides a framework for analyzing predicative computability in set theory.

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.