皆様
九州大学の河村です。フロリアン・シュタインベルク氏(仏INRIA)の講演を
以下のように開催いたしますので、お近くの方はどうぞお越しください。
http://www.fc.inf.kyushu-u.ac.jp/seminars/H300705.html
日時 July 5, 2018, Thursday, 16:40–
場所 Room 302, Ito Campus West Building II, Kyushu University
(九州大学伊都キャンパスウエスト二号館302講義室)
Type-two poly-time and length revisions
Florian Steinberg (Institut National de Recherche en Informatique et en
Automatique)
The talk presents an alternate characterization of type-two
polynomial-time computability, with the goal of making second-order
complexity theory more approachable. The characterization relies on the
usual oracle machines to model programs with subroutine calls, but the
use of higher-order objects as running times is avoided. This is
achieved by refining the notion of oracle-polynomial-time introduced by
Cook by imposing a further restriction on the oracle interactions. Both
the restriction as well as its purpose are very simple: it is well-known
that Cook's model allows polynomial depth iteration of functional inputs
with no restrictions on size, and thus does not guarantee that operators
from the class preserve polynomial-time computability. We restrict the
number of lookahead revisions, that is the number of times a query can
be asked that is bigger than any of the previous queries and prove that
this leads to a class of feasible functionals. Furthermore, all feasible
problems can be solved within this class if one is allowed to separate a
task into efficiently solvable subtasks. More formally put: the closure
of the class under lambda-abstraction and application includes all
feasible operations. This has consequences for a very similar class of
strongly polynomial-time computable operators previously considered by
Kawamura and Steinberg: It turns out to have the same closure property.
This can be attributed to properties of the limited recursion operator,
which is not strongly polynomial-time computable but decomposes into two
such operations and lies in the broader class.
--
河村彰星
九州大学システム情報科学研究院情報学部門
〒819-0395 福岡市西区元岡744
092-802-3806
kawamura(a)inf.kyushu-u.ac.jp
皆様
以下の要領で名古屋ロジックセミナーを開催します.多数のご参加をお待ちしております.
講演終了後に夕食会を予定しています.夕食会にご参加いただける方は,早めに木原貴行 kihara(a)i.nagoya-u.ac.jp までご一報お願い致します.
名古屋ロジックセミナー
http://www.math.mi.i.nagoya-u.ac.jp/~kihara/logic-seminar.html
日時:6月29日 (金) 15:30〜
場所:名古屋大学大学院情報学研究科棟 314室
講演者:Paul-Elliot Anglès D'Auriac (パリ・エスト・クレテイユ大学)
題目: On Infinite Time Turing Machine and and its related ordinals
アブストラクト:
In 1998, Hamkins and Lewis introduced Infinite Time Turing Machines (ITTMs), a version of Turing Machines where time is allowed to run through the ordinals instead of the integers. This model of computation revealed itself to have interesting connections with set theory and in particular Godel's constructible hierarchy. In this talk, we will be interested in the properties of the ordinals that naturally arises in the study of ITTMs, such as those that correspond to halting time, or that have a code that can be written on the tape of an ITTM.
--------
Takayuki Kihara
Graduate School of Informatics, Nagoya University, Japan
URL: http://math.mi.i.nagoya-u.ac.jp/~kihara/index-j.html
Email: kihara(a)i.nagoya-u.ac.jp
皆様
今週木曜日に、京都大学にてKohei Kishidaさんのご講演があります。
詳細は以下のとおりです。どうぞお気軽にご参加ください。
京都大学数理解析研究所
照井一成
====================
Time: 11:00-12:00, 28 June, 2018
Place: Rm 478, Research Building 2, Main Campus, Kyoto University
京都大学 本部構内 総合研究2号館 4階478号室
http://www.kyoto-u.ac.jp/en/access/yoshida/main.html (Building 34)
Speaker: Kohei Kishida (Dalhousie University)
Title: A Topological Approach to Quantum Contextuality
Abstract:
Non-locality and contextuality are paradoxical phenomena in quantum physics
that are of foundational and potentially great practical significance:
While non-locality is known to be fundamental to quantum communication,
the more general phenomenon of contextuality may provide a key resource for
quantum computation, as suggested by recent studies. This has motivated
several approaches to the high-level expression of non-locality and
contextuality that can be independent of the concrete formalism of quantum
mechanics.
Starting with a review of the paradoxical probabilistic behavior of
non-locality, this talk lays out some formalisms that express non-locality
and contextuality. In particular, the topological approach makes it clear
that contextuality is isomorphic to various phenomena in other
disciplines.
We show two results, one on the relationship between probabilistic and
qualitative versions of contextuality, and the other on how to use a
topological idea to demonstrate (qualitative) contextuality.
This talk is based on several joint works with Samson Abramsky,
Rui Soares Barbosa, Ray Lal and Shane Mansfield.
皆様,
ロボットのパスプランニングの研究に関する講演会を
6月21日の13:00より,京都大学吉田キャンパス
総合研究7号館1F講義室3で開催します.
話者のGeorgios Fainekosさんは,時相論理式で記述された
システムの仕様をチェックするツールS-TaLiRoで有名な方です.
どうぞご参加ください.
Prof. Georgios Fainekos is giving a talk about path planning in robotics
on June 21st from 13:00-- at the lecture room 3 in
Research Building 7 (Sogo-Kenkyu 7 gou kan) in
Yoshida campus of Kyoto University.
Georgios is famous for the work on a tool S-TaLiRo,
a checker of a system specification written in an extension of
temporal logic called metric temporal logic.
Looking forward to your participation!
Kohei
--
Title:
Temporal Logic Planning for Mobile Robots: What happens when missions
cannot be satisfied?
Abstract:
Temporal logic planning methods have provided a viable path towards
solving the single- and multi-robot path planning, control and
coordination problems from high level formal requirements. In the
existing frameworks, the prevalent assumptions are (1) that a plan
always exists which satisfies the mission requirements, and (2) that
there is a single stakeholder with full or partial knowledge of the
environment that the robots operate in. In addition, it is typically
assumed that the requirements themselves are fixed and do not change
over time. However, any of these assumptions may not be valid in both
off-line and on-line temporal logic planning problems. That is,
multiple stakeholders and inaccurate sources of information may
produce unsatisfiable missions or self-contradictory models of the
world or the system. Classical temporal logic planning methods cannot
handle non-consistent model environments or missions even though such
inconsistencies may not affect the planning problem. In this talk, we
present how the user feedback problem for unsatisfiable missions can
be reduced to searching for an optimal weighted path on a graph.
Albeit the general search problem is NP-complete, the graph
formulation of the problem opens-up the possibility for the
development of efficient approximation algorithms. We present a number
of heuristics for quickly computing such user feedback and we present
experimental results on the performance and scalability of our
solutions. Finally, we show how inconsistencies and conflicts in the
mission requirements and the model of the world can be circumvented by
utilizing multi-valued temporal logics and system models.
Bio:
Georgios Fainekos is an Associate Professor at the School of
Computing, Informatics and Decision Systems Engineering (SCIDSE) at
Arizona State University (ASU). He is director of the Cyber-Physical
Systems (CPS) Lab and he is currently affiliated with the NSF I/UCR
Center for Embedded Systems (CES) at ASU. He received his Ph.D. in
Computer and Information Science from the University of Pennsylvania
in 2008 where he was affiliated with the GRASP laboratory. He holds a
Diploma degree (B.Sc. & M.Sc.) in Mechanical Engineering from the
National Technical University of Athens (NTUA). Before joining ASU, he
held a Postdoctoral Researcher position at NEC Laboratories America in
the System Analysis & Verification Group. His expertise is on logic,
formal verification, testing, control theory, artificial intelligence,
and optimization. His research has applications to automotive systems,
medical devices, autonomous (ground and aerial) vehicles, and
human-robot interaction (HRI). In 2013, Dr. Fainekos received the NSF
CAREER award and the ASU SCIDSE Best Researcher Junior Faculty Award.
He is also recipient of the 2008 Frank Anger Memorial ACM
SIGBED/SIGSOFT Student Award. His software toolbox, S-TaLiRo, for
testing and monitoring of CPS has been nominated twice as a
technological breakthrough by the industry. In 2016, Dr. Fainekos was
the program co-Chair for the ACM International Conference on Hybrid
Systems: Computation and Control (HSCC).
--
Kohei Suenaga (末永幸平), Ph.D
Associate professor (准教授)
Graduate School of Informatics, Kyoto University
(京都大学情報学研究科)
ksuenaga(a)gmail.com
http://www.fos.kuis.kyoto-u.ac.jp/~ksuenaga/
Dear all,
Let me announce CTFM 2018.
Workshop on Computability Theory and Foundations of Mathematics 2018
Date: 13--15 September, 2018
The venue: Surugadai Campus, Meiji University, Tokyo,
Invited Speakers
George Barmpalias (Chinese Academy of Sciences)
Matthew de Brecht (Kyoto University)
Bjorn Kjos-Hanssen (University of Hawaii at Manoa)
Tomoyuki Miyaji (Meiji University)
Igor Potapov (University of Liverpool)
Liang Yu (Nanjing University)
Organising Committee
Akitoshi Kawamura (Kyushu University)
Kenshi Miyabe (Meiji University)
Computability Theory and Foundations of Mathematics (CTFM) aims to
develop computability theory and logical foundations of Mathematics.
The scope involves the topics Computability Theory, Reverse
Mathematics, Nonstandard Analysis, Proof Theory, Set Theory,
Philosophy of Mathematics, Constructive Mathematics, Theory of
Randomness and Computational Complexity Theory.
We will call for the contributed talks later.
For other information, see the following website:
http://www.isc.meiji.ac.jp/~random/ctfm2018/
best,
Kenshi Miyabe
--
Kenshi Miyabe
email (research) : research(a)kenshi.miyabe.name
email (other) : miyabe(a)meiji.ac.jp
Associate Professor
Department of Mathematics
School of Science and Technology
Meiji University
Tel: +81-44-934-7460