Approximation and complexity of functions on the integers

  • Authors:

  • D. Tsichritzis

  • Affiliations:

  • -

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 1971

Quantified Score

Hi-index 0.07

Visualization

Abstract

Fuzzy properties and relations are defined on countable sets and a notion of approximation between functions on the integers is proposed. Hierarchies of functions based on approximate behavior are defined and their complexities compared. The success of approximation of a function f is investigated with respect to the complexity of the approximating function g.