Cyril Collard: Les nuit fauves

Il a 30 ans. Il aime des garcons; Samy, à moitié voyou; Jamel, fils de l’islam et de coca-cola. Et les corps anonyms qui s’emparent de lui dans les rites pervers des nuits fauves. Il aime des filles de passage. Et Laura. Il veut tout. Ou peut-être rien.
Il est séropositif. Lâcheté ou panique, il ne lá pas dit à Laura, la première fois qu’íls ont fait l’amour. Il l’a peut-être contaminée. Ella a 17 ans. Elle l’aime, sans mesure, jusqu’à la folie, usant de tout pour ne pas le perdre: priers, violences, mensonges, chantage.
Ils se prennent et se déprennent dans un rythme serré de clip où les rues basculent devant les motos, où la camera vidéo film les ombres et les lumières de la ville, où le répondeur téléphonique hache les mots de la passion. Avec, soudain, de lentes plages de mémoire – celles de l’adolescence, du sang arabe, de lieux solaire.
Alors, un novel ordre s’établit: menacé de mort, il nait au monde qui l’entoure, à l’amoure fou de ce qui est. Il est vivant.

Hofstadter's Law

Hofstadter's Law was a part of Douglas Hofstadter's 1979 book Gödel, Escher, Bach: An Eternal Golden Braid. The law is a statement regarding the difficulty of accurately estimating the time it will take to complete tasks of any substantial complexity.[2] It is often cited amongst programmers, especially in discussions of techniques to improve productivity, such as The Mythical Man-Month or extreme programming.[3] The recursive nature of the law is a reflection of the universal experience of difficulty experienced in estimating complex tasks despite all best efforts, including knowing that the task is complex. The law was initially introduced in connection with a discussion of chess playing computers, where as top-level players were continuously beating machines, even though the machines outweighed the players in recursive analysis. The intuition was that the players were able to focus on particular positions instead of following every possible line of play to its conclusion. Hofstadter wrote: “In the early days of computer chess, people used to estimate that it would be ten years until a computer (or program) was world champion. But after ten years had passed, it seemed that the day a computer would become world champion was still more than ten years away”.[4][5] He then suggests that this was “just one more piece of evidence for the rather recursive Hofstadter’s Law.”[6] /From wikipedia