Andere Kunden interessierten sich auch für
![Brouwer fixed point theorem]( "Brouwer fixed point theorem")
Brouwer fixed point theorem22,99 €![Black Scholes]( "Black Scholes")
Black Scholes19,99 €![Some Common Fixed Point Theorems In Metric And Cone Metric Spaces]( "Some Common Fixed Point Theorems In Metric And Cone Metric Spaces")
Some Common Fixed Point Theorems In Metric And Cone Metric Spaces32,99 €![The Extension of Fixed Point Theorems in Various b-Metric Spaces]( "The Extension of Fixed Point Theorems in Various b-Metric Spaces")
The Extension of Fixed Point Theorems in Various b-Metric Spaces57,99 €![Fixed Point Problems in Probabilistic And Fuzzy Metric Spaces]( "Fixed Point Problems in Probabilistic And Fuzzy Metric Spaces")
Fixed Point Problems in Probabilistic And Fuzzy Metric Spaces36,99 €![Approximate Fixed Point Theorems with Applications]( "Approximate Fixed Point Theorems with Applications")
Approximate Fixed Point Theorems with Applications36,99 €![The Investigation of Results of Fixed Point in Abstract Spaces]( "The Investigation of Results of Fixed Point in Abstract Spaces")
The Investigation of Results of Fixed Point in Abstract Spaces51,99 €
A fixed point combinator is a higher-order function that computes a fixed point of other functions. A fixed point of a function f is a value x such that f(x) = x. For example, 0 and 1 are fixed points of the function f(x) = x2, because 02 = 0 and 12 = 1. Whereas a fixed-point of a first-order function is a first-order value, a fixed point of a higher-order function f is another function p such that f(p) = p