On Productiveness and Complexity in Computable Analysis Through Rice-Style Theorems for Real Functions

On Productiveness and Complexity in Computable Analysis Through Rice-Style Theorems for Real Functions

This paper investigates the complexity of real functions through proof techniques inspired by formal language theory. Productiveness, which is a stronger form of non-recursive enumerability, is employed to analyze the complexity of various problems related to real functions. Our work provides a deep...

Full description

Saved in:
Bibliographic Details
Main Authors: Jingnan Xie, Harry B. Hunt, Richard E. Stearns
Format: Article
Language:English
Published: MDPI AG 2024-10-01
Series:Mathematics
Subjects:
computable analysis
undecidability
productiveness
computational complexity
functions of real variables
Hilbert’s tenth problem
Online Access:https://www.mdpi.com/2227-7390/12/20/3248
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/2227-7390/12/20/3248

Similar Items