Complexity of approximating functions on real-life computers

Research output: Contribution to journalArticlepeer-review

Abstract

We address the problem of estimating the computation time necessary to approximate a function on a real computer. Our approach gives a possibility to estimate the minimal time needed to compute a function up to the specified level of error. This can be explained by the following example. Consider the space of functions defined on [0,1] whose absolute value and the first derivative are bounded by C. In a certain sense, for almost every such function, approximating it on its domain using an Intel x86 computer, with an error not greater than ε, takes at least k(C, ε) seconds. Here we show how to find k(C, ε).

Original languageEnglish
Pages (from-to)153-157
Number of pages5
JournalInternational Journal of Foundations of Computer Science
Volume26
Issue number1
DOIs
Publication statusPublished - 25 Jan 2015
Externally publishedYes

Keywords

  • Computational complexity
  • information theory
  • performance evaluation
  • ε-entropy

Fingerprint

Dive into the research topics of 'Complexity of approximating functions on real-life computers'. Together they form a unique fingerprint.

Cite this