Levis Zerpa, Ph.D., of the School of Mathematical and Computational Sciences, was one of the keynote speakers at the VI REDU Congress.
Levis Zerpa, Ph.D., professor of the School of Mathematical and Computational Sciences, gave a keynote speech at the VI REDU Congress. He was invited as one of the main speakers in the ICT and Industrial Processes axis. His speech, titled “Computational complexity and artificial intelligence: Challenges for academia and industry”, was directly related to the research project that he is conducting in the Department of Computational Sciences and Engineering, of the School of Mathematical and Computational Sciences. The Congress took place at the facilities of Universidad Técnica del Norte, in Ibarra.
Dr. Zerpa’s research project focuses on one of the most intensely studied open problems of computer science: the problem of propositional SATability (also Boolean Satisfaction or Propositional Satisfiability). In addition to his research, his speech was also based on the content of the specific courses taught in the Department, which are related to: Computational complexity, computational logic, parallel computing and artificial intelligence.
During his speech, Levis also mentioned the challenges and specific goals for both researchers as representatives of academia, and for IT industry and other productive sectors of the country.
