EUR 5,55
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Bon. Ancien livre de bibliothèque. Traces d'usure sur la couverture. Couverture différente. Edition 1981. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Signs of wear on the cover. Different cover. Edition 1981. Ammareal gives back up to 15% of this item's net price to charity organizations.
Vendeur : BookDepart, Shepherdstown, WV, Etats-Unis
EUR 16,58
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : UsedGood. Hardcover; surplus library copy with the usual stampings; reference number taped to spine; fading, scuffing, and shelf wear to exterior; in good condition with clean text, firm binding.
Vendeur : Rivermead Books, Southampton., Royaume-Uni
Edition originale
EUR 10,73
Quantité disponible : 1 disponible(s)
Ajouter au panierHard Cover. Etat : Very Good. No Jacket. First Edition. VG, hardback, white pictorial glazed boards with green titles on tarnished spine, contents are clean and unmarked, 279pp. Ex-Royal Aircraft Establishment Library, weight 500g. International Lecture series in Computer Science. Ex-Library.
EUR 14
Quantité disponible : 1 disponible(s)
Ajouter au panier.- London - New York - Toronto - Sydney - San Francisco. 1981. Academic Press . 4º menor. XIII- 279 pgs. Cartoné editorial. Muy buen estado. . . ISBN 10: 0121229203. Informática.
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 40,58
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! In computer science, termination analysis attempts to determine whether the evaluation of a given program will definitely terminate. It is a form of program analysis that is related to the halting problem. Because the Halting Problem is undecidable, termination analysis cannot work correctly in all cases. The aim is to find the answer 'program does terminate' (or 'program does not terminate') whenever this is possible. Without success the algorithm (or human) working on the termination analysis may answer with 'maybe' or continue working infinitely long.