×
Studying Physics Studying Mathematics Research The Faculty SL
Events News Staff Directory Timetables For staff Search

David Gajser: Kako preveriti, ali je dani Turingov stroj konstantne časovne zahtevnosti?

Date of publication: 19. 11. 2012
Mathematics and theoretical computing seminar
Torek, 20. 11. 2012, od 12h do 14h, Plemljev seminar, Jadranska 19

Povzetek. Odgovor: Ne obstaja algoritem, s katerim bi to naredili.

Vabljeni! 

Thu
17
Sep
Nejc Zajc: Denotational semantics for the optimising compilation of algebraic effect handlers
Mathematics and theoretical computing seminar
10:15 - Jadranska 21, učilnica 3.05
Thu
10
Sep
Takayuki Kihara: Oracle modalities on the modified realizability topos
Mathematics and theoretical computing seminar
11:15 - Jadranska 21, učilnica 2.03
Thu
10
Sep
Satoshi Nakata: A j-translation with Kripke forcing relation
Mathematics and theoretical computing seminar
10:15 - Jadranska 21, učilnica 2.03
Thu
3
Sep
Holger Thies: Towards certified ODE solving in Rocq
Mathematics and theoretical computing seminar
10:15 - Jadranska 21, predavalnica P.01
Wed
17
Jun
Felix Cherubini: Overtness in Synthetic Algebraic Geometry
Mathematics and theoretical computing seminar
13:15 - Jadranska 21, učilnica 1.01

All news