BEGIN:VCALENDAR
VERSION:2.0
PRODID:talks.ox.ac.uk
BEGIN:VEVENT
SUMMARY:On the circulation structures in traditional Chinese algorithms -
GUO Shirong (Institute for the History of Science and Technology，Inner M
ongolia Normal University)
DTSTART;VALUE=DATE-TIME:20190625T170000
DTEND;VALUE=DATE-TIME:20190625T180000
UID:https://talks.ox.ac.uk/talks/id/3aad851f-ae3d-42d1-b3af-cf5bfd7ca4e3/
DESCRIPTION:It is unnecessary to emphasize important place of algorithms i
n computer science. Many efficient and convenient algorithms are designed
by borrowing or revising ancient mathematical algorithms and methods. For
example\, recursive method\, exhaustive search method\, greedy method\,
“divide and conquer” method\, dynamic programming method\, reiteration
algorithm\, circulation algorithm\, among others. \n\nFrom the perspecti
ve of the history of computer science\, it is necessary to study the histo
ry of algorithms used in the computer computations. The history of algorit
hms for computer science is naturally regarded as a sub-object of history
of mathematics. But historians of mathematics\, at least those who study h
istory of mathematics in China\, have not realized it is important in the
history of mathematics. Historians of Chinese mathematics paid little atte
ntion to these studies\, mainly having not considered from this research a
ngle. Relevant research is therefore insufficient in the field of history
of mathematics. \n\nThe mechanization thought and algorithmization charact
eristic of Chinese traditional (and therefore\, East Asian) mathematics\,
however\, are coincident with that of computer science. Traditional Chines
e algorithms\, therefore\, show their importance historical significance i
n computer science. It is necessary and important to survey traditional al
gorithms again from the point of views of computer science. It is also ano
ther angle for understanding traditional Chinese mathematics. \n\nThere ar
e many things in the field that need to be researched. For example\, when
and how were these algorithms designed? What was their mathematical backgr
ound? How were they applied in ancient mathematical context? How are their
complexity and efficiency of ancient algorithms? \n\nIn the present paper
\, we will study the circulation structure in traditional Chinese mathemat
ical algorithms. Circulation structures have great importance in the compu
ter science. Most algorithms are designed by means of one or more circulat
ion structures. Ancient Chinese mathematicians were familiar them with the
circulation structures and good at their applications. They designed a lo
t of circulation structures to obtain their desirable results in mathemati
cal computations. Their circulation structures of dozen ancient algorithms
will be analyzed. They are selected from mathematical and astronomical tr
eatises\, and also one from the Yijing (Book of Changes)\, the oldest of t
he Chinese classics. \nSpeakers:\nGUO Shirong (Institute for the History o
f Science and Technology，Inner Mongolia Normal University)
LOCATION:Mathematical Institute (Room L4)\, Woodstock Road OX2 6GG
TZID:Europe/London
URL:https://talks.ox.ac.uk/talks/id/3aad851f-ae3d-42d1-b3af-cf5bfd7ca4e3/
BEGIN:VALARM
ACTION:display
DESCRIPTION:Talk:On the circulation structures in traditional Chinese algo
rithms - GUO Shirong (Institute for the History of Science and Technology
，Inner Mongolia Normal University)
TRIGGER:-PT1H
END:VALARM
END:VEVENT
END:VCALENDAR