皆様
JAIST Logic Seminar Seriesのお知らせです。
ふるってご参加ください。
問合せ先:
石原 哉
北陸先端科学技術大学院大学 情報科学研究科
e-mail: ishihara(a)jaist.ac.jp
--------------------------------------------------
* JAIST Logic Seminar Series *
* This seminar is held as a part of the EU FP7 Marie Curie Actions
IRSES project COMPUTAL (http://computal.uni-trier.de/).
Date: Monday 29 July, 2013, 15:00-17:00
Place: JAIST, Collaboration room 7 (I-56)
(Access: http://www.jaist.ac.jp/english/location/access.html)
Speaker: Professor Martin Ziegler (Technische Universitaet Darmstadt)
Title: HENKIN CONTINUITY OF MULTIVALUED FUNCTIONS
(joint work with Arno Pauly)
Abstract:
A type-2 computable real function is necessarily continuous;
and this remains true for relative, i.e. oracle-based, computations.
Conversely, by the Weierstrass Approximation Theorem, every continuous
$f:[0;1]\to\mathbb{R}$ is computable relative to some oracle.
In their search for a similar topological characterization of
relatively computable \emph{multi-}valued functions
$f:[0;1]\rightrightarrows\mathbb{R}$ (aka multi-functions or relations),
Brattka and Hertling (1994) have considered
two notions: weak continuity (which is weaker than relative computability)
and strong continuity (which is stronger than relative computability).
Observing that \emph{uniform} continuity plays a crucial role
in the Weierstrass Theorem, we propose and compare several notions
of uniform continuity for relations. Here, due to the additional
quantification over values $y\in f(x)$, new ways arise of (linearly)
ordering quantifiers---yet none turns out as satisfactory.
We are thus led to a concept of uniform continuity based on
the \textsf{Henkin quantifier}; and prove it necessary
for relative computability of compact real relations.
In fact iterating this condition
yields a strict hierarchy of notions each necessary ---
and the $\omega$-th level also sufficient ---
for relative computability. A refined, quantitative analysis
exhibits a similar topological characterization of
relative polynomial-time computability.
--
Professor Hajime Ishihara
School of Information Science
Japan Advanced Institute of Science and Technology
1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan
Tel: +81-761-51-1206
Fax: +81-761-51-1149
ishihara(a)jaist.ac.jp
http://www.jaist.ac.jp/~ishihara
皆様
9月18日〜20日に行われます書換えに関する研究集会「第39回TRSミーティング」の
参加者募集の案内をお送り致します。
http://www.jaist.ac.jp/~c-sterna/39th-trs-meeting/
今回の会場は秋田市さとみ温泉でして、すでに名古屋大学から大山口教授、
また海外からはインスブルック大学の Middeldorp 教授、Zankl 研究員の
参加が決まっております。
皆様、ぜひ参加をご検討下さい!
廣川 (JAIST)
----------------------------------------------------------------------
39th TRS Meeting
Akita
http://www.jaist.ac.jp/~c-sterna/39th-trs-meeting/
About the TRS Meeting
The Term Rewriting Meeting (TRS Meeting) is a biannual informal
workshop that aims at promoting the research on rewriting and related
areas. Participants are requested to give a talk of approximately 15 to
60 minutes in English on their research activities. The subject of the
talk is not required to be one's original result; for example,
explaining an interesting paper is perfectly OK. (See Rewriting
Researchers Forum for further information:
http://www.jaist.ac.jp/~hirokawa/trs-meeting/)
Information
Date: September 18 (Wed) -- 20 (Fri), 2013
Venue: Akita Onsen Satomi,
http://www.satomi-e.com
Keidaikawara Soegawa, Akita, 010-0822
Program
September 18 (Wed)
14:00-18:00 meeting
September 19 (Thu)
9:00-18:00: meeting
September 20 (Fri)
9:00-12:00: meeting
Fee
~ 26,000 yen (including lodging, breakfast, and dinner for 2 nights)
Registration
Please indicate whether you would like to join by sending the
registration form below to Christian Sternagel
(c-sterna(a)jaist.ac.jp) no later than August 15, 2013.
----------------------------------------------------------------------
Registration Form of the 39th TRS Meeting
name:
affiliation:
title of talk*:
approximate duration of talk (in minutes)*:
preference on your room: [A single room is preferred / A shared room is
acceptable](choose one)
(In case of partial participation, please contact me)
----------------------------------------------------------------------
The items marked with * can be sent later.
Contact
Christian Sternagel (c-sterna(a)jaist.ac.jp)
転送します.蓮尾
---------- Forwarded message ----------
From: Alexander Kurz <ak155(a)mcs.le.ac.uk>
Date: Fri, Jul 5, 2013 at 8:10 PM
Subject: categories: PhD positions in Leicester
To: categories <categories(a)mta.ca>
Hi All,
we have 3 PhD positions in Computer Science, deadline 29th July.
http://www2.le.ac.uk/study/research/funding/computerscience-gta
Applications by students interested in a PhD on Category Theory in
Computer Science are particularly welcome, despite the fact that
category theory is not listed under "topics of particular interest" in
the advert, which was an oversight.
I would be very grateful if you could pass this on to potential
candidates. Ideally, interested students would get in touch with me
directly before applying formally.
Best wishes,
Alexander
[For admin and other information see: http://www.mta.ca/~cat-dist/ ]
皆様:
以下の要領で名古屋数学基礎論セミナーを開催します。
奮って御参加下さい。
日時:7月5日(金) 15:30-
場所:名古屋大学 全学教育棟3階 SIS5 教室
(http://www.nagoya-u.ac.jp/2012website/global-info/images/access-map/map2.pdf の地図でB4(1)の建物です。
建物内配置図は http://www.ilas.nagoya-u.ac.jp/student/lectureroom/ でご覧になれます。
SIS5 教室は3階の中央より少し北, C36の北隣にあります。)
講演者:John Pardo (ペンシルバニア州立大学, JSPSサマープログラム研究員(北陸先端大))
題: Forcing and Basis Theorems in Computability Theory
アブストラクト:The technique of forcing, primarily known for its applications in set theory, has proven to be quite useful in computability theory as well. I will discuss how forcing is made effective in the computable sense, as well as use this technique to prove the Low Basis Theorem, the Hyper-immune free Basis Theorem, and the Cone-Avoidance Basis Theorem, all of which are due to Jockusch and Soare.
(7/2 に神戸大学で予定されている講演と概ね同内容ですのでご注意下さい。)