Information, computation, and logic are defining concepts of the modern era. Shannon laid the foundation of information theory, demonstrating that problems of communication and compression can be precisely modeled, formulated, and analyzed. Turing formalized computation defined as the transformation of information by means of algorithms.  Godel established modern foundation of logic, laying the foundation for modern computer science and science of information.

Shannon's focus was originally on data recovery in compression and communication, but information is not merely communicated, it is also acquired, represented, inferred, processed, aggregated, managed, valued, secured, and computed.  Computational information explores those properties of information that can be feasibly extracted. Existence of an object is of limited utility if no reasonable algorithm can provably generate such an object.  Infeasibility may arise for a number of different reasons:  the desired information may be computationally hard to extract; the information may be distributed geographically and not locally extractable; or information may be encoded in (quantum) physical ways that prevent full extraction.  In contrast to the classical theory of information, where precise quantitative limits can be established in most cases, in the computational setting, information is not well understood qualitatively, with exponential gaps between the upper and lower bounds on the amount of feasibly extractable information.

We must add logic to this paradigm. At its most basic, logic is the study of consequence. The core intuition motivating including logic in information is that an informational state may be characterized by the range of possibilities or configurations that are compatible with the information available at that state. But logic may restrict range of possibility, directly impacting just information. Furthermore, logic ``unusual effectiveness in computer science'', from descriptive complexity to type theory (including Voevodsky univalent axiom) to reasoning about knowledge closes the loop from logic to information to computation. Understanding how to harness it in order to deepen connections to a theory of information remains very much an open question.

There are plenty of questions with very few satisfying answers: Is there a way to account for the meaning or semantics of information?  Can we construct a theory information that is representation-invariant? What is misinformation?

Details: https://www.soihub.org/krakow/

The Polish Combinatorial Conferences are meant to integrate Polish and international combinatorial communities. The upcoming conference is, as before, dedicated mostly to young scientists whose attendance we strive to support (see below). Having this goal in mind, besides several invited talks, we provide also a couple of tutorials by leading experts in Combinatorics.

The scope of the conference is intended to cover most aspects of modern combinatorics, including graph theory, probabilistic combinatorics, extremal combinatorics, combinatorial optimization, algorithmic problems, combinatorial number theory, applications of combinatorics in computer science.

Details: 7pcc.tcs.uj.edu.pl

The workshop will be an informal meeting of around 30 people working in combinatorics and theoretical computer science with special emphasis on discrete geometry, partially ordered sets and all kinds of interplays between them.

This includes: geometric intersection graphs, geometric representations of graphs, point and line arrangements, Schnyder woods and related graph orientations, parameters of partially ordered sets, especially order dimension.

Details: orderandgeometry2018.tcs.uj.edu.pl

Wykład Wydziałowy Analytic information theory 21.06 o godzinie 11:00 w sali 1016

Analytic information theory aims at studying problems of information theory
using analytic techniques of computer science and combinatorics. Following Hadamard's precept, we tackle these problems by complex analysis methods
such as generating functions, Mellin transform, Fourier series, saddle point method, analytic poissonization and depoissonization, and singularity
analysis. This approach lies at the crossroad of computer science and information theory. In this talk, we concentrate on one facet of information theory namely, source coding better known as data compression and present several results illustrating the power of analytic methods.

The talk is dedicated to Don. E. Knuth for his 80th birthday.

FIT is a Polish theoretical computer science meeting organized on a yearly basis since 1991. This year the meeting will take place in Kraków on May 11–12 in Przegorzały guesthouse of the Jagiellonian University.

Details: https://fit.tcs.uj.edu.pl/

Details can be found at https://sites.google.com/site/acmracs2017/

RACS 2017 will provide an excellent forum for addressing research issues of concern within the adaptive and convergent computing area. Adaptive and convergent computing concentrates on innovative solutions to complex problems in all areas of industry and sciences using adaptive and convergent techniques in computer science and engineering. It involves programming, software engineering, graphics, databases, wireless networks, security, distributed systems, operating systems and so on.

Serdecznie zapraszamy na najbliższe Uniwersyteckie Zawody Informatyczne (UZI), które odbędą się 22 października 2016 w budynku Wydziału Matematyki i Informatyki UJ, ul. Łojasiewicza 6. Początek o godzinie 9:00 – dokładny harmonogram i regulamin można znaleźć tutaj.

Są to eliminacje na najbliższe zawody:

• Akademickie Mistrzostwa Polski w Programowaniu Zespołowym, Wrocław, 28-29.X.2016
• ACM ICPC, Central European Regional Contest, Zagreb, Chorwacja, 18-21.XI.2016,

a w perspektywie – do startu w ACM ICPC World Finals, Rapid City, SD, USA, May 20-25, 2017.

Zgłoszenia zespołow prosze dokonywac mailowo na adres idziak@tcs.uj.edu.pl z podaniem:

• imienia i nazwiska zawodników,
• adresów mailowych,
• rozmiarów koszulek,

do czwartku 20 X 2016 do godz 13:59.

Details http://orderandgeometry2016.tcs.uj.edu.pl/

Details can be found at http://www.aofa2016.meetings.pl

It aims at studying discrete objects that appear as data structures or algorithms (including graphs, networks etc.) by mathematical methods, in particular by probabilistic, combinatorial and asymptotic methods.

Poster Topics include :

• Properties of large random data structures

• Probabilistic methods for the analysis of algorithms

• Combinatorial methods for the analysis of algorithms

• Analytic tools for the analysis of algorithms

• Average case analysis of classical or new algorithms

• Analytic and enumerative combinatorics

• Random trees and graphs

• Branching processes

• Stochastic processes in relation with random discrete structures

• Random walks

• Discrete probabilities

• Random generation of combinatorial structures

• Data compression and language-modeling methods.

• Performance evaluation

The programming contest "UZI" will take place on October 17, 2015. It will help selecting teams to represent Jagiellonian University in:

• Polish Collegiate Programming Contest, Wroclaw, October 2015
• ACM - Central European Regional Contest, Zagreb, November 2015

The programming contest "UZI" will take place on April 25, 2015. It will help selecting teams to represent Jagiellonian University in:

• Polish Collegiate Programming Contest, Wroclaw, October 2015
• ACM - Central European Regional Contest, Zagreb, November 2015

Szczegóły na stronie http://workshop.tcs.uj.edu.pl/mszana2015/

Komitet Okręgowy Olimpiady Informatycznej w Krakowie

Katedra Algorytmiki Uniwersytetu Jagiellońskiego

ul. Prof. Stanisława Łojasiewicza 6, 30-348 Kraków

tel.: 12 664 66 47

harmonogram zawodów

Więcej informacji

Więcej informacji na stronie zawodów
 

The goal of the workshop is to familiarize the participants with some modern trends in theoretical computer science. Every day a tutorial will be given, consisting of a lecture and exercises, some open problems will be also left for ambitious :) This year our experts will cover the following topics:

• Friday, LP-based algorithms for Facility Location problems, Jarosław Byrka
• Saturday, Approximation Algorithms for the Traveling Salesman Problem, Ola Svensson
• Sunday, Algorithmic aspects of communication channel, Dariusz Kowalski

The workshop will take place at Faculty of Mathematics and Computer Science at Jagiellonian University, 10-12 October 2014.

Schedule

The programming contest "UZI" will take place on March 29, 2014.

It will help selecting teams to represent Jagiellonian University in:

• Polish Collegiate Programming Contest, Warszawa, October 24-26, 2014
• ACM - Central European Programming Contest, Kraków, November 14-16, 2014

Więcej informacji na stronie zawodów

Zapraszamy na kolejną edycję Informatyki na szlaku!
 

Więcej informacji na stronie zawodów