|
Géraud Sénizergues
Géraud Sénizergues (born 9 March 1957) is a French computer scientist at the University of Bordeaux. He is known for his contributions to automata theory, combinatorial group theory and abstract rewriting systems. He received his Ph.D. (Doctorat d'état en Informatique) from the Université Paris Diderot (Paris 7) in 1987 under the direction of Jean-Michel Autebert. With Yuri Matiyasevich he obtained results about the Post correspondence problem. He won the 2002 Gödel Prize "for proving that equivalence of deterministic pushdown automata In automata theory, a deterministic pushdown automaton (DPDA or DPA) is a variation of the pushdown automaton. The class of deterministic pushdown automata accepts the deterministic context-free languages, a proper subset of context-free languages. ... is decidable". In 2003 he was awarded with the Gay-Lussac Humboldt Prize. References External linksHomepage* Living people French computer scientists Academic staff of the Unive ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gödel Prize
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory (ACM SIGACT). The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the " P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time. The Gödel Prize has been awarded since 1993. The prize is awarded either at STOC (ACM Symposium on Theory of Computing, one of the main North American conferences in theoretical computer science) or ICALP (International Colloquium on Automata, Languages and Programming, one of the main European conferences in the field). To be eligible for the prize, a paper must be published ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Yuri Matiyasevich
Yuri Vladimirovich Matiyasevich, (russian: Ю́рий Влади́мирович Матиясе́вич; born 2 March 1947 in Leningrad) is a Russian mathematician and computer scientist. He is best known for his negative solution of Hilbert's tenth problem ( Matiyasevich's theorem), which was presented in his doctoral thesis at LOMI (the Leningrad Department of the Steklov Institute of Mathematics). Biography * In 1962–1963, Matiyasevich studied at Saint Petersburg Lyceum 239; * In 1963–1964, he studied aKolmogorov School in 1964 he was the absolute winner of the All-Union Olympiad in mathematics * In 1964–1969, Matiyasevich studied at thMathematics & Mechanics Facultyof Leningrad State University. By qualifying for the USSR team for the International Mathematical Olympiad (where he won a gold medal), Yuri Matiyasevich was accepted without exams to Leningrad State University, skipping the last year of high school studies. * In 1966, he presented a talk at Interna ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Academic Staff Of The University Of Bordeaux
An academy (Attic Greek: Ἀκαδήμεια; Koine Greek Ἀκαδημία) is an institution of secondary or tertiary higher learning (and generally also research or honorary membership). The name traces back to Plato's school of philosophy, founded approximately 385 BC at Akademia, a sanctuary of Athena, the goddess of wisdom and skill, north of Athens, Greece. Etymology The word comes from the ''Academy'' in ancient Greece, which derives from the Athenian hero, ''Akademos''. Outside the city walls of Athens, the gymnasium was made famous by Plato as a center of learning. The sacred space, dedicated to the goddess of wisdom, Athena, had formerly been an olive grove, hence the expression "the groves of Academe". In these gardens, the philosopher Plato conversed with followers. Plato developed his sessions into a method of teaching philosophy and in 387 BC, established what is known today as the Old Academy. By extension, ''academia'' has come to mean the accumulation, dev ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
French Computer Scientists
French (french: français(e), link=no) may refer to: * Something of, from, or related to France ** French language, which originated in France, and its various dialects and accents ** French people, a nation and ethnic group identified with France ** French cuisine, cooking traditions and practices Fortnite French places Arts and media * The French (band), a British rock band * "French" (episode), a live-action episode of ''The Super Mario Bros. Super Show!'' * ''Française'' (film), 2008 * French Stewart (born 1964), American actor Other uses * French (surname), a surname (including a list of people with the name) * French (tunic), a particular type of military jacket or tunic used in the Russian Empire and Soviet Union * French's, an American brand of mustard condiment * French catheter scale, a unit of measurement of diameter * French Defence, a chess opening * French kiss, a type of kiss involving the tongue See also * France (other) * Franch, a surname * Fren ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Decidability (logic)
In logic, a true/false decision problem is decidable if there exists an effective method for deriving the correct answer. Zeroth-order logic (propositional logic) is decidable, whereas first-order and higher-order logic are not. Logical systems are decidable if membership in their set of logically valid formulas (or theorems) can be effectively determined. A theory (set of sentences closed under logical consequence) in a fixed logical system is decidable if there is an effective method for determining whether arbitrary formulas are included in the theory. Many important problems are undecidable, that is, it has been proven that no effective method for determining membership (returning a correct answer after finite, though possibly very long, time in all cases) can exist for them. Decidability of a logical system Each logical system comes with both a syntactic component, which among other things determines the notion of provability, and a semantic component, which determines ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Deterministic Pushdown Automaton
In automata theory, a deterministic pushdown automaton (DPDA or DPA) is a variation of the pushdown automaton. The class of deterministic pushdown automata accepts the deterministic context-free languages, a proper subset of context-free languages. Machine transitions are based on the current state and input symbol, and also the current topmost symbol of the stack. Symbols lower in the stack are not visible and have no immediate effect. Machine actions include pushing, popping, or replacing the stack top. A deterministic pushdown automaton has at most one legal transition for the same combination of input symbol, state, and top stack symbol. This is where it differs from the nondeterministic pushdown automaton. Formal definition A (not necessarily deterministic) PDA M can be defined as a 7-tuple: :M=(Q\,, \Sigma\,, \Gamma\,, q_0\,, Z_0\,, A\,, \delta\,) where *Q\, is a finite set of states *\Sigma\, is a finite set of input symbols *\Gamma\, is a finite set of stack symbols ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Post Correspondence Problem
The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946. Because it is simpler than the halting problem and the ''Entscheidungsproblem'' it is often used in proofs of undecidability. Definition of the problem Let A be an alphabet with at least two symbols. The input of the problem consists of two finite lists \alpha_, \ldots, \alpha_ and \beta_, \ldots, \beta_ of words over A. A solution to this problem is a sequence of indices (i_k)_ with K \ge 1 and 1 \le i_k \le N for all k, such that : \alpha_ \ldots \alpha_ = \beta_ \ldots \beta_. The decision problem then is to decide whether such a solution exists or not. Alternative definition :g: (i_1,\ldots,i_K) \mapsto \alpha_ \ldots \alpha_ :h: (i_1,\ldots,i_K) \mapsto \beta_ \ldots \beta_. This gives rise to an equivalent alternative definition often found in the literature, according to which any two homomorphisms g,h with a common domain and a common codomain form an in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jean-Michel Autebert
Jean-Michel is a French masculine given name. It may refer to : * Jean-Michel Arnold, General Secretary of the Cinémathèque Française * Jean-Michel Atlan (1913–1960), French artist * Jean-Michel Aulas (born 1949), French businessman * Jean-Michel Badiane (born 1983), French football defender of Senegalese descent * Jean-Michel Basquiat (1960–1988), American artist * Jean-Michel Bayle (born 1969), semi-retired French professional motorcycle racer * Jean-Michel Baylet (born 1946), French politician, Senator, and leader of the Radical Party * Jean-Michel Bazire (born 1971), French harness racing driver * Jean-Michel Bellot (born 1953), retired French male pole vaulter * Jean-Michel Berthelot (1945–2006), French sociologist, philosopher, epistemologist and social theorist * Jean-Michel Bertrand (1943–2008) * Jean-Michel Beysser (1753–1794), French general * Jean-Michel Bismut (born 1948), French mathematician * Jean-Michel Bokamba-Yangouma, Congolese politician * Jean-Michel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gay-Lussac Humboldt Prize
Joseph Louis Gay-Lussac (, , ; 6 December 1778 – 9 May 1850) was a French chemist and physicist. He is known mostly for his discovery that water is made of two parts hydrogen and one part oxygen (with Alexander von Humboldt), for two laws related to gases, and for his work on alcohol–water mixtures, which led to the degrees Gay-Lussac used to measure alcoholic beverages in many countries. Biography Gay-Lussac was born at Saint-Léonard-de-Noblat in the present-day department of Haute-Vienne. The father of Joseph Louis Gay, Anthony Gay, son of a doctor, was a lawyer and prosecutor and worked as a judge in Noblat Bridge. Father of two sons and three daughters, he owned much of the Lussac village and usually added the name of this hamlet of the Haute-Vienne to his name, following a custom of the Ancien Régime. Towards the year 1803, father and son finally adopted the name Gay-Lussac. During the Revolution, on behalf of the Law of Suspects, his father, former king's atto ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Université Paris Diderot
Paris Diderot University, also known as Paris 7 (french: Université Paris Diderot), was a French university located in Paris, France. It was one of the inheritors of the historic University of Paris, which was split into 13 universities in 1970. Paris Diderot merged with Paris Descartes University in 2019 to form Paris Cité University. With two Nobel Prize laureates, two Fields Medal winners and two former French Ministers of Education among its faculty or former faculty, the university was famous for its teaching in science, especially in mathematics. Many fundamental results of the theory of probability were discovered at one of its research centres, the ''Laboratoire de Probabilités et Modèles Aléatoires'' (Laboratory of Probability and Random Models). History Paris Diderot University was one of the heirs of the old University of Paris, which ceased to exist in 1970. Professors from the faculties of Science, of Medicine and of Humanities chose then to create a new m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
