Computational Adequacy Theorem

This states that for any program (a non-function typed term in the typed lambda-calculus with constants) normal order reduction (outermost first) fails to terminate if and only if the standard semantics of the term is bottom. Moreover, if the reduction of program e1 terminates with some head normal form e2 then the standard semantics of e1 and e2 will be equal. This theorem is significant because it relates the operational notion of a reduction sequence and the denotational semantics of the input and output of a reduction sequence.

computational complexity

<algorithm>

The number of steps or arithmetic operations required to solve a computational problem. One of the three kinds of complexity.

Last updated: 1996-04-24

Computational Fluid Dynamics

<language>

(CFD) A Fortran-based parallel language for the Illiac IV.

Last updated: 1994-11-29

computational geometry

<mathematics>

The study of algorithms for combinatorial, topological, and metric problems concerning sets of points, typically in Euclidean space. Representative areas of research include geometric search, convexity, proximity, intersection, and linear programming.

Last updated: 1997-08-03

computational learning

grammatical inference

computational molecular biology

<application>

The area of bioinformatics concerning the use of computers to characterise the molecular components of living things.

Last updated: 2005-01-07

Nearby terms:

COMputable MAthematics ♦ Computational Adequacy Theorem ♦ computational complexity

Try this search on Wikipedia, Wiktionary, Google, OneLook.

Loading