Jean-Paul Delahaye is a specialist in complexity theory. He is also a mathematician, computer scientist, and French writer.<\/p>\n
He earned his doctorate in mathematics in 1982 and initiated the design of complexity titled ‘the computational design of games and information algorithmics.’ He has worked on the computational theory of games since 1996 and on randomness since 2004. His previous research themes included the theory of transformations of sequences (from 1977 to 1982, concluded with his state thesis) and logic programming related to artificial intelligence (from 1982 to 1998).<\/p>\n
Jean-Paul Delahaye has written works on computer science regarding the number (Pi) and prime numbers, notably: A Call for Vigilance Against Neo-Creationism and Spiritualist Intrusions in Science (2005), as well as mathematical articles such as ‘Logic and Computation’ for the journal Pour la Science and others for the Encyclop\u00e6dia Universalis specialized in paper and DVD formats.<\/p>\n
Today, Jean-Paul Delahaye is a professor of computer science at the University of Science and Technology of Lille and a researcher at the Lille Fundamental Computer Science Laboratory.<\/p>\n
As a popularizer researcher, Jean-Paul Delahaye won the Prix d’Alembert from the Mathematical Society of France for The Fascinating Number Pi in 1998 and the First Prize for Scientific Culture from the Ministry of National Education, Research, and Technology in 1999.<\/p>\n","protected":false},"excerpt":{"rendered":"
Jean-Paul Delahaye is a specialist in complexity theory. He is also a mathematician, computer scientist, and French writer. He earned his doctorate in mathematics in 1982 and initiated the design of complexity titled ‘the computational design of games and information algorithmics.’ He has worked on the computational theory of games since 1996 and on randomness […]<\/p>\n","protected":false},"featured_media":55824,"template":"","meta":{"_acf_changed":false,"_trash_the_other_posts":false,"editor_notices":[]},"sa_speaker_category":[32,39,138,41,37,33],"sa_language":[],"sa_employability":[],"class_list":["post-81853","sa_speaker","type-sa_speaker","status-publish","has-post-thumbnail","hentry","sa_speaker_category-communication-media","sa_speaker_category-entrepreneurship","sa_speaker_category-governance-management","sa_speaker_category-health","sa_speaker_category-leadership-strategy","sa_speaker_category-science"],"acf":{"sa_introduction":"Jean-Paul Delahaye is a specialist in complexity theory. He is also a mathematician, computer scientist, and French writer.\n\nHe earned his doctorate in mathematics in 1982 and initiated the design of complexity titled 'the computational design of games and information algorithmics.' He has worked on the computational theory of games since 1996 and on randomness since 2004. His previous research themes included the theory of transformations of sequences (from 1977 to 1982, concluded with his state thesis) and logic programming related to artificial intelligence (from 1982 to 1998).","sa_one_liner":"Specialist in Complexity Theory","sa_name_title":"","sa_region":[],"sa_degree":"","sa_stars":"","sa_maglr_ids":null,"sa_publications":null,"sa_socials":null,"sa_subjects":[{"sa_subjects_title":"The theory of complexity: random complexity and organisational complexity","sa_subjects_information":""},{"sa_subjects_title":"Paradoxes in mathematics, in the arts, in statistics, etc.","sa_subjects_information":""},{"sa_subjects_title":"Game theory: lessons learned from the prisoners' dilemma","sa_subjects_information":""},{"sa_subjects_title":"Search engines. Google PageRank etc. Finding information on the internet","sa_subjects_information":""}],"sa_faq_items":null,"sa_minimum_price":"0","sa_maximum_price":"0","sa_banner_image_id":null,"sa_videos":null,"sa_order_score":0},"yoast_head":"\n