logo btn eng btn_stm
sub rgt bg

title                                     

                                                                                          CSE Seminars (2017 Spring) 포스터보기

2017.04.26(Wed)
"Large-scale image search "
윤성의 교수(KAIST)
2017.05.04(Thu)
"4차산업혁명시대의 문화정책"
정종은 박사(한국문화관광연구원)
2017.05.10(Wed)
"Trends in 5G Millimeter-Wave Wireless Networking Research"
김중헌 교수(중앙대학교)
2017.05.24(Wed)
"Interactions on Various Display Types"
김기범 교수(계명대학교)

글번호
6341392
일 자
17.02.27
조회수
263
글쓴이
학과사무실
제목 : 2017.03.15(Wed) ''Theoretical Computer Science for Numerics' - Prof.Martin Ziegler (KAIST)
-Titile: Theoretical Computer Science for Numerics

-Biograpy 

MSc (Mathematics+Physics) 1997 Paderborn University,
PhD (Computer Science) 2002 Paderborn University,
Habilitation/Venia Legendi (Computer Science) 2008 Paderborn University,
DFG Heisenberg Scholar 2009 Vienna University of Technology,
Associate Professor of Logic 2010-2015 Darmstadt Technical University


-Abstract

Theoretical Computer Science provides the sound foundation
and concepts underlying contemporary algorithm design and
reliable software development for discrete problems:
Problems in the continuous realm commonly considered in Numerical
Engineering are largely treated by 'recipes' and 'methods' whose
correctness and efficiency often rely on thin empirical evidence.
   We extend and apply the rigorous theory of computation (specification,
semantics, algorithm design, analysis, and proof of optimality) over
discrete structures to continuous domains. For instance it turns out that
famous complexity classes like P, NP, #P, and PSPACE naturally re-emerge
in the setting of real numbers, sequences, continuous functions,
operators, and Euclidean subsets including a reformulation of the
Millennium Prize Problem as a numerical one. Our current work develops a
computability and complexity classification for ordinary and partial
differential equations, the latter having weak solutions naturally
'living' in Sobolev space.

첨부파일 첨부파일:
첨부파일이 없습니다.
목록으로