Geben Sie ein Wort oder eine Phrase in einer beliebigen Sprache ein 👆
Sprache:
Übersetzung und Analyse von Wörtern durch künstliche Intelligenz ChatGPT
Auf dieser Seite erhalten Sie eine detaillierte Analyse eines Wortes oder einer Phrase mithilfe der besten heute verfügbaren Technologie der künstlichen Intelligenz:
- wie das Wort verwendet wird
- Häufigkeit der Nutzung
- es wird häufiger in mündlicher oder schriftlicher Rede verwendet
- Wortübersetzungsoptionen
- Anwendungsbeispiele (mehrere Phrasen mit Übersetzung)
- Etymologie
Was (wer) ist applicative order reduction - definition
TECHNIQUE FOR SOLVING LINEAR ORDINARY DIFFERENTIAL EQUATIONS
Reduction of Order
applicative order reduction
WIKIMEDIA DISAMBIGUATION PAGE
Reduction strategy (code optimization); Applicative order reduction; Reduction strategy (lambda calculus)
<programming> An evaluation strategy under which an
expression is evaluated by repeatedly evaluating its leftmost
innermost redex. This means that a function's arguments are
evaluated before the function is applied. This method will
not terminate if a function is given a non-terminating
expression as an argument even if the function is not strict
in that argument. Also known as call-by-value since the
values of arguments are passed rather than their names. This
is the evaluation strategy used by ML, Scheme, Hope and
most procedural languages such as C and Pascal.
See also normal order reduction, parallel reduction.
(1995-01-25)
reduction strategy
WIKIMEDIA DISAMBIGUATION PAGE
Reduction strategy (code optimization); Applicative order reduction; Reduction strategy (lambda calculus)
<theory> An algorithm for deciding which redex(es) to
reduce next. Different strategies have different termination
properties in the presence of recursive functions or values.
See string reduction, normal order reduction, {applicative
order reduction}, parallel reduction
(1995-05-09)
Reduction strategy
WIKIMEDIA DISAMBIGUATION PAGE
Reduction strategy (code optimization); Applicative order reduction; Reduction strategy (lambda calculus)
In rewriting, a reduction strategy or rewriting strategy is a relation specifying a rewrite for each object or term, compatible with a given reduction relation. Some authors use the term to refer to an evaluation strategy.
Wikipedia
Reduction of order
Reduction of order (or d’Alembert reduction) is a technique in mathematics for solving second-order linear ordinary differential equations. It is employed when one solution is known and a second linearly independent solution is desired. The method also applies to n-th order equations. In this case the ansatz will yield an (n−1)-th order equation for .
