We give a primitive recursive algorithm (for the structure of integers - in unary - and lists of integers ) that computes the minimum of two integers in linear time of this minimum. This algorithm refutes a conjecture of L.Colson
Publié le : 1993-01-18
Classification:
[MATH.MATH-LO]Mathematics [math]/Logic [math.LO],
[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
@article{hal-00385000,
author = {David, Ren\'e},
title = {Un algorithme primitif r\'ecursif pour la fonction Inf},
journal = {HAL},
volume = {1993},
number = {0},
year = {1993},
language = {fr},
url = {http://dml.mathdoc.fr/item/hal-00385000}
}
David, René. Un algorithme primitif récursif pour la fonction Inf. HAL, Tome 1993 (1993) no. 0, . http://gdmltest.u-ga.fr/item/hal-00385000/