Skip to main content

Continuous If-Then Statements Are Computable

  • Chapter
Book cover Constraint Programming and Decision Making

Part of the book series: Studies in Computational Intelligence ((SCI,volume 539))

  • 1341 Accesses

Abstract

In many practical situations, we must compute the value of an if-then expression f(x) defined as “if c(x) ≥ 0 then f  + (x) else f (x)”, where f  + (x), f (x), and c(x) are computable functions. The value f(x) cannot be computed directly, since in general, it is not possible to check whether a given real number c(x) is non-negative or non-positive. Similarly, it is not possible to compute the value f(x) if the if-then function is discontinuous, i.e., when f  + (x 0) ≠ f (x 0) for some x 0 for which c(x 0) = 0.

In this paper, we show that if the if-then expression is continuous, then we can effectively compute f(x).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brattka, V., Gherardi, G.: Weihrauch degrees, omniscience principle, and weak computability. In: Bauer, A., Dillhage, R., Hertling, P., Ko, K.-I., Rettinger, R. (eds.) Proceedings of the Sixth International Conference on Computability and Complexity in Analysis CCA 2009, Ljubljana, Slovenia, August 18-22, pp. 81–92 (2009)

    Google Scholar 

  2. Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer, Dordrecht (1998)

    Google Scholar 

  3. Weihrauch, K.: Computable Analysis: An Introduction. Springer, New York (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Martine Ceberio .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Ceberio, M., Kreinovich, V. (2014). Continuous If-Then Statements Are Computable. In: Ceberio, M., Kreinovich, V. (eds) Constraint Programming and Decision Making. Studies in Computational Intelligence, vol 539. Springer, Cham. https://doi.org/10.1007/978-3-319-04280-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04280-0_3

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04279-4

  • Online ISBN: 978-3-319-04280-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics