16

2018-10

201804期 Computable models --With introduction to Sobolev Institute of Mathematics in Russia

来源:系统管理员     浏览次数:

学术讲座

Computable models --With introduction to Sobolev Institute of Mathematics in Russia


主讲嘉宾: Professor Sergey S. Goncharov

(Member of Academy of Sciences in Russia)

时间:2018313 下午2:30

地址:深圳大学计算机与软件学院1楼报告厅



Biography of Sergey Goncharov

Professor Sergey Goncharov graduated with honours from the Department of Mechanics and Mathematics of Novosibirsk State University (NSU) in 1973 and defended thesis for candidatskaya degree in 1974. In 1976, he won Lenin Komsomol Prize on science and technology for a series of works on constructive Boolean Algebras. He became an associated professor at NSU. He defended thesis for doctorskaya degree in 1981 and was awarded with a Silver badge of Algebra and Logic Seminar for research activityin 1982. In 1983, he won Siberian Branch of Russian Academy of Sciences Prize for establishing the theory of semantic programming in cooperation with Yu. L. Ershov and D. I. Sviridenko. He became a professor at Novosibirsk State University in 1985 and an elector at Russian Academy of Sciences in 1991. He was elected to be a corresponding member of the Academy of Sciences of Higher School in 1993 and was elected to be a full member of the International Academy of Sciences of Higher School in 1995. In 1997, he was elected to be a corresponding member of the Russian Academy of Sciences. He won Mal'sev prize of Russian Academy of Sciences in 1997. In 2002, he was elected to be a member of the Russian Academy of Sciences. In 2013, he  was elected to be a member of the Presidium of Siberian Branch of Russian Academy of Sciences. In 2016, he was elected to be academician (full member) of the European Academy of Sciences. He won Lavrent’ev prize of Siberian Branch of Russian Academy of Sciences in 2017.

Abstract

Fields of research interest: theory of algorithms, model theory, algebra, and applications in theoretical computer science. Basing on the result on the existence of non-autostable models with finite algorithmic dimension, the theory of algorithmic dimension is developed. New methods to prove infinite algorithmic dimension are found. These methods made possible a solution to the problem of characterization of spectra of algorithmic dimension for series of concrete classes of models. A criterion of decidability for homogeneous models is established. Basing on it, solutions to problems of M. Morley and of Peretyatkin–Denisov were obtained. A solution to the Malcev problem on the characterization of classes of axioms with strong epimorphisms and strong homomorphisms is given. A series of results on constructive Boolean algebras is obtained. Nilpotent groups of finite algorithmic dimension were studied. A characterization is obtained for autostability of nilpotent torsion-free groups of finite rank as well as for Abelian pp-groups. A new method to construct computable numbering is suggested that made possible solutions to a series of problems on Friedberg numberings, on families with unique positive numbering, etc. A solution to the problem of autostability of finitary constant expansions was obtained together with American scientists R. Shore, B. Khoussainov, and P. Cholak. A solution to the problem of two-element spectrum with recursive TT-degree was obtained together with B.Khoussainov. A problem on a family with trivial Rogers semilattice but nontrivial inclusion was solved together with S. A. Badaev. A problem on the existence of strong constructive homogeneous extensions is solved. Together with an Italian logician A. Sorbi, the Rogers semilattice of computable numberings of arithmetical sets was investigated. Together with J. Knight (USA), the structure theory of computable classes of models is suggested, a problem of characterization of Σ11Σ11-relations on computable models is solved. More than 160 papers were published; among them are two manuals: "Lectures in model theory" and "Introduction to the logic and methodology of science" (with Yu. L. Ershov and K. F. Samokhvalov), monographs: "Countable Boolean algebras" (1988) and "Countable Boolean algebras and decidability" (1996, English translation 1997), "Constructive models" (1999, with Yu. L. Ershov, English translation 2000) and "Handbook of recursive mathematics" (1999, S. S. Goncharov, Yu. L. Ershov, A. Nerode, J. Remmel, V. Marek editors).

Sobolev Institute of Mathematics

Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences is located in Novosibirsk, Akademgorodok. The Institute was foundered in 1957 by Academician Sergey Sobolev. At present the Institute is directed by Member of RAS, Professor, Doctor of Sciences (Physics and Mathematics) Sergey Goncharov. The members of the Institute carry on fundamental investigations in mathematics, mathematical physics, and informatics in the following main directions:

  •  algebra, theory of numbers and mathematical logic;
  •  geometry and topology;
  •  calculas, differential equations and mathematical physics;
  •  probability and mathematical statistics;
  •  numerical mathematics;
  •  mathematical modeling and methods of applied mathematics;
  •  theoretical nuclear physics.

The investigations carried on at the Institute are supported by various domestic and interactive funds. In 2004, the Institute had 54 grants of  the Russia Foundation for Basic Research, 8 grants of the Russia Humanitarian Scientific Foundation, 4 grants of the Federal Pilot Program “Integration”, etc. In the frames of the state program for support of leading scientific schools, the grants were allotted to 7 scientific schools headed by A. A. Borovkov, Yu. L. Ershov, M. M. Lavrent’ev, Yu. G. Reshetnyak, S. S. Goncharov, V. L. Beresnev and V. A. Vasil’ev. State scholarships for prominent scientists are awarded to 20 members of the Institute, and 9 men received state scholarships for young scientists.

The Institute participates actively in training of highly qualified scientific personnel in cooperation with the Department of Mechanics and Mathematics of Novosibirsk State University.

相关论文发表

博士生导师

  • 黄哲学

    黄哲学

    黄哲学,瑞典皇家理工学院博士、深圳大学特聘教授、博士生导师,深圳大学大数据技术与应用研究所所长、大数据系统计算技术国家工程实验室副主任,首批广东省领军人才、深圳孔雀计划高层次人才,斯坦福大学全球“终身科学影响力排行榜”前2%顶尖科学家。符号数据快速聚类算法研究的开拓者,发表了k-modes等一系列著名聚类算法,被纳入国内外教科书和专著,进入软件产品。发表学术论文250多篇,主要论文被引用超万次。领导开发了全球首个面向算力网络的多数据中心大数据协同计算系统Octopus,最近获深圳第二十五届中国国际高新技术成果交易会“优秀产品奖”和“华为杯”第五届中国研究生人工智能创新大赛“一等奖”。
  • 黄哲学

    崔来中

    2007年6月于吉林大学获工学学士学位,同年被免试推荐直接攻读博士研究生,2012年6月于清华大学获计算机科学与技术博士学位。研究领域包括:下一代互联网体系结构、软件定义网络、边缘计算、大数据分析、机器学习和智能计算。国际电子工程师学会高级会员(IEEE Senior Member),中国计算机学会高级会员(CCF Senior Member),人工智能学会(CAAI)会员,CCF互联网专委会常委,CCF大数据专家委员会委员、CCF区块链专委会委员,CAAI知识工程与分布智能委员会副秘书长。担任SCI期刊《International Journal of Machine Learning and Cybernetics》、《International Journal of Bio-Inspired Computation 》和《Ad Hoc and Sensor Wireless Networks》的副编辑/编委。已主持国家重点研发计划课题、国家自然科学基金,广东省自然科学基金,广东省育苗工程,深圳市基础研究计划项目等项目10多项。已在国内外重要期刊以及国际会议上发表SCI/EI检索论文80余篇。《计算机网络》课程负责人,课程入选广东省一流本科课程。入选广东省青年珠江学者,深圳市优青、深圳市高层次人才和深圳大学“荔园优青”人才培养计划。
  • 黄哲学

    陈梓楠

    陈梓楠(博士,国家海外优青,IEEE会员,ACM会员)现在担任深圳大学计算机与软件学院特聘教授。在研期间一共发表了顶级会议和期刊将近30篇论文,其中CCF A类论文有19篇(第一作者有12篇),主持了国家自然科学优秀青年(海外)项目1项和国家自然科学青年基金项目1项。此外,陈老师也是各大国际会议(包括:VLDB 2022 - 2024 (demo track)、VLDB 2025 (research track)、SIGKDD 2024 、ICDE 2022和2024、EDBT 2023、IJCAI 2020、DASFAA 2021 - 2024和WISE 2019 - 2024)和国际期刊(包括:VLDBJ、TKDE、AIJ、IEEE Transactions on Computers (TC)、WWWJ、 TSAS 、TNSE、PR Journal、DKE、JCST、The Journal of Supercomputing等等)的审稿人,并担任MDM 2021 - 2024的会议论文集主席 (proceedings chair)。

科研项目

联系我们
0755-2653 0821