Future Researcher: Welcome by Mr Leivant (Q3696570): Difference between revisions
Jump to navigation
Jump to search
(Changed label, description and/or aliases in en: translated_label) |
(Changed an Item: Edited by the beneficiary bot - attach the beneficiary based on the string) |
||
| Property / beneficiary | |||
| Property / beneficiary: Q2536134 / rank | |||
Normal rank | |||
Revision as of 18:26, 24 November 2021
Project Q3696570 in France
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Future Researcher: Welcome by Mr Leivant |
Project Q3696570 in France |
Statements
27,455.0 Euro
0 references
54,910.0 Euro
0 references
50.0 percent
0 references
1 October 2015
0 references
30 June 2017
0 references
Université de Lorraine
0 references
Le projet concerne l’accueil de Monsieur Daniel LEIVANT, Professeur à l'Université d'Indiana (Bloomington) aux Etats-Unis, au Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA) pour une durée d’un an. Au cours des deux dernières années, le travail de Daniel LEIVANT a influencé et irrigué la recherche en complexité implicite. La complexité implicite a pour objectif de développer des modèles analytiques des calculs sur ordinateur en prenant en compte les ressources nécessaires à ces calculs. Ces travaux permettent à la fois d’essayer de répondre aux conjectures fondamentales de la théorie de la complexité et à la fois à fournir des systèmes de programmation ou de preuve qui intègrent la notion de ressources. (French)
0 references
The project concerns the welcome of Daniel LEIVANT, Professor at the University of Indiana (Bloomington) in the United States, at the Lorrain Laboratory of Research in Informatics and its Applications (LORIA) for a period of one year. Over the past two years, Daniel LEIVANT’s work has influenced and irrigated research in implicit complexity. The purpose of implicit complexity is to develop analytical models of computer-based calculations, taking into account the resources required for these calculations. This work allows both to try to respond to the fundamental conjectures of the theory of complexity and both to provide programming or evidence systems that integrate the notion of resources. (English)
22 November 2021
0 references
Identifiers
LO0007486
0 references