皆様
九州大学の河村と申します。イゴル・ポタポフ氏（リヴァプール大）の講演を9月19日（水）に開催いたします。どうぞお気軽にご参加ください。
http://www.fc.inf.kyushu-u.ac.jp/seminars/H300919.html
Time: September 19, 2018, Wednesday 14:50–15:50
Place: Room 310, Ito Campus West Building 2, Kyushu University
九州大学伊都キャンパス ウエスト二号館310講義室
Pattern formations with broadcasting automata model
Igor Potapov (University of Liverpool)
The Broadcasting Automata model draws inspiration from a variety of
sources such as Ad-Hoc radio networks, cellular automata, neighbourhood
sequences and natural phenomena like superposition of waves and
resonance. Algorithms for the broadcasting automata model are in the
same vein as those encountered in distributed algorithms using a simple
notion of waves, messages passed from automata to automata throughout
the topology, to construct computations. The waves generated by
activating processes in a digital environment can be used for designing
a variety of wave algorithms. In this work we analyse the geometrical
shapes of informational waves on integer grid generated in broadcasting
automata model as well as their potential use for metric approximation
in a discrete space, pattern formations and new distributed algorithms.
--
河村彰星
九州大学システム情報科学研究院情報学部門
〒819-0395 福岡市西区元岡744
092-802-3806
kawamura(a)inf.kyushu-u.ac.jp
皆様
９月２０日（木）に JAIST にて行われます、インスブルック大学
Aart Middeldorp 教授の講演のお知らせです。
皆様、どうぞ奮ってご参加ください！
廣川 直 (JAIST)
-----------------------------------------------------------------------
* JAIST Logic Seminar Series *
Date: Thursday 20 September, 2018, 14:00-15:00
Place: I-56 (Collaboration Room 7) at JAIST
(Access: http://www.jaist.ac.jp/english/location/access.html)
Speaker: Prof. Aart Middeldorp (University of Innsbruck)
Title: Automating Proof Terms in Term Rewriting
Abstract:
Proof terms are a useful concept for reasoning about computations in
term rewriting. This talk gives an introduction to proof terms and
mentions some of the challenges when reasoning about proof terms.
Since human calculation with proof terms is tedious and error-prone,
the tool ProTeM was developed that offers support for manipulating
proof terms in left-linear rewrite systems. We use ProTeM throughout
the talk to illustrate the various operations on proof terms. The
talk is based on joint work with Christina Kohl.
-----------------------------------------------------------------------
