|
|
|
|
6
November (Friday) 4:15
PM ONLINE
|
Dániel
Kodaj
|
|
Department of
General Philosophy, Institute
of Philosophy, Eötvös
University, Budapest
Institute
of Philosophy,
Research Centre for
the Humanities,
Budapest
|
| |
Probability
as teleology
|
I’m going to argue for
an unusual variety of frequentism.
Roughly, the idea is that an event
type E is probabilistic iff
repetitions of E (e.g. successive
coin flips) will display a
characteristic distribution in a
finite time. On the resulting
picture, probability is a form of
teleology, in a sense related to
Gerd Sommerhoff’s and Richard
Braithwaite’s definitions of
teleology.
|
|
13
November (Friday) 4:15
PM ONLINE
|
Réka
Markovich
|
|
Computer
Science
Department, University
of Luxembourg
Department
of Logic, Eötvös
Loránd University
|
| |
Modeling
Conflict of Laws in
Input/Output Logic
|
Conflict of Laws is a
branch of law within Private
International Law dedicated to
providing metarules in legal
situations where more than one
national legal systems’ rules
could be applied: CoL rules
indirectly settle the situation by
declaring which one’s should. The
formal representation of how these
rules work contributes not only to
the modeling of this branch of law
but it also provides methodologies
for concerns arising from other
conflicting normative systems,
such as ethically sensitive
situations where there are
multiple stakeholders with
different moral backgrounds,
therefore, it is applicable in AI
ethics. But this formal
representation requires a new
approach of normative reasoning as
the structure of rules in Col is
rather special.
In the talk, I will briefly
introduce the used formalism, the
family of Input/Output Logics, and
their relevance in normative
reasoning, and show how CoL can be
modeled using this approach.
|
|
20
November (Friday) 4:15
PM ONLINE
|
Manolo
Martínez
|
|
Department of
Philosophy, Universitat de
Barcelona
|
| |
What is
Information Processing?
|
It is often claimed that
information processing and
computation are intimately
related. In this paper I take a
closer look at and clarify this
relation. Information processing
should be thought of as the set of
operations on signals that help
fulfill the goal of getting
information from A to B, where A
and B can be places, times, or
simply two random variables with
different vocabularies.
I will first argue that there are
three main kinds of
information-processing operations.
Two of them, compression and noise
protection, have been successfully
described and quantified by
information theory in the
Shannonian tradition. The third
one, the translation between
random-variable vocabularies, has
not. I will show, first, that
translation cannot be reduced to
(and is rather presupposed by) the
other two operations; I will then
explore ways in which it could be
described and quantified. Finally,
relying on the foregoing
discussion, I will put together a
tentative picture of the relation
between computation, information
processing, and (for good measure)
representation.
|
|
27
November (Friday) 4:15
PM ONLINE
|
|
Teymur
Ismikhanov
|
|
Logic and Theory
of Science MA Program, Eötvös
University, Budapest
|
| |
Lambda
calculus and its models
|
Lambda calculus is a
formal system developed for
expressing computation based on
function abstraction and
application. Since the concept of
a function embodied in the lambda
calculus is very general, we
cannot model it as ordinary
mathematical functions.
Nevertheless, models of the lambda
calculus do exist and in this
talk, we shall first introduce the
syntax of the lambda calculus and
then present an introduction to
its models.
|
|
|
|
|
