Proving Programs Terminate Using Well-Founded Orderings, Ramsey's Theorem, and Matrices.

William I. Gasarch

Published in: Adv. Comput. (2015)

Keyphrases

singular value decomposition
computer programs
real time
high level
von neumann
coefficient matrix
provably correct
neural network
data mining
artificial intelligence
least squares
operating system
programming environment
singular values