{"id":1449,"date":"2017-05-26T13:28:49","date_gmt":"2017-05-26T13:28:49","guid":{"rendered":"http:\/\/math.utu.fi\/cie2017\/?page_id=1449"},"modified":"2017-06-15T16:04:46","modified_gmt":"2017-06-15T16:04:46","slug":"schedule","status":"publish","type":"page","link":"https:\/\/math.utu.fi\/cie2017\/schedule\/","title":{"rendered":"Schedule"},"content":{"rendered":"

 <\/p>\n\u00b4<\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Monday, 12. June 2017<\/span><\/th>\n<\/tr>\n<\/thead>\n
8:30\u20139:15<\/td>\nRegistration<\/td>\n<\/tr>\n
9:15\u20139:30<\/td>\nOpening<\/td>\n<\/tr>\n
9:30\u201310:30<\/td>\n Ramsey\u2019s theorem under a computable perspective<\/b>
\nLudovic Patey <\/em><\/td>\n<\/tr>\n
10:30\u201311:00<\/td>\nCoffee<\/td>\n<\/tr>\n
11:00\u201312:30<\/td>\nTutorial, part 1: Computability theory, reverse mathematics, and combinatorial principles<\/b>
\nDenis Hirschfeldt <\/em><\/td>\n<\/tr>\n
12:30\u201313:30<\/td>\nLunch<\/td>\n<\/tr>\n
13:30\u201314:30<\/td>\nDynamic and structural properties of the computably enumerable sets<\/b>
\nKaren Lange<\/em><\/td>\n<\/tr>\n
14:30\u201315:00<\/td>\nCoffee<\/td>\n<\/tr>\n
<\/td>\nSpecial sessions<\/strong><\/span><\/td>\n<\/tr>\n
Room 1<\/td>\nRoom 2<\/td>\nRoom 3<\/td>\n<\/tr>\n
Computability in analysis, algebra, and geometry 1<\/strong><\/td>\nHistory and philosophy of computing 1<\/strong><\/td>\nCryptography and information theory 1<\/strong><\/td>\n<\/tr>\n
15:00\u201315:45<\/td>\nSaugata Basu<\/em>
\nComplexity in different contexts<\/td>\n		Juliette Kennedy<\/em>
\nG\u00f6del\u2019s Reception of Turing\u2019s Model of Computability: the Shift of Perception in 1934<\/td>\n		Ivan Visconti<\/em>
\nDelayed-Input Cryptographic Protocols<\/td>\n<\/tr>\n
15:45\u201316:30<\/td>\nMargarita Korovina<\/em>
\nOutline of Partial Computability in Computable Topology<\/td>\n		Jan von Plato<\/em>
\nRosa Politzer and the beginnings of the theory of computable functions<\/td>\n		Luka Music<\/em>
\nGarbled Quantum Computation<\/td>\n<\/tr>\n
16:30\u201316:45<\/td>\nBreak<\/td>\n<\/tr>\n
<\/td>\nSpecial sessions<\/strong><\/span><\/td>\n<\/tr>\n
Room 1<\/td>\nRoom 2<\/td>\nRoom 3<\/td>\n<\/tr>\n
Computability in analysis, algebra, and geometry 2<\/strong><\/td>\nHistory and philosophy of computing 2<\/strong><\/td>\nCryptography and information theory 2<\/strong><\/td>\n<\/tr>\n
16:45\u201317:30<\/td>\nAlexander Melnikov<\/em>
\nEliminating unbounded search in computable algebra<\/td>\n		Hector Zenil <\/em>
\nComputability and Causality<\/td>\n		Delaram Kahrobaei<\/em>
\nPost-quantum Group-Based Cryptography<\/td>\n<\/tr>\n
17:30\u201318:15<\/td>\nRussell Miller<\/em>
\nComputable Transformations of Structures<\/td>\n		Cliff Jones<\/em>
\nTuring\u2019s 1949 paper in context<\/td>\n		Helger Lipmaa<\/em>
\nA shuffle argument secure in the generic model<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Tuesday, 13. June 2017<\/span><\/th>\n<\/tr>\n<\/thead>\n
9:00\u201310:00<\/td>\n The Church-Turing Thesis and Physics<\/b>
\nScott Aaronson <\/em><\/td>\n<\/tr>\n
10:00\u201310:30<\/td>\nCoffee<\/td>\n<\/tr>\n
<\/td>\nContributed session 1<\/strong><\/span><\/td>\n<\/tr>\n
Room 1<\/td>\nRoom 2<\/td>\nRoom 3<\/td>\n<\/tr>\n
10:30\u201311:00<\/td>\nGleb Novikov<\/em>
\nRandomness deficiencies<\/td>\n		Hugo Nobrega, Arno Pauly<\/em>
\nGame characterizations and lower cones in the Weihrauch degrees<\/td>\n		Thierry Monteil<\/em>
\nA universal oracle for signal machines<\/td>\n<\/tr>\n
11:00\u201311:30<\/td>\nNeil Lutz, Donald Stull<\/em>
\nDimension Spectra of Lines<\/td>\n		Victor Selivanov<\/em>
\nExtending Wadge Theory to k-Partitions<\/td>\n		Ville Salo, Ilkka T\u00f6rm\u00e4<\/em>
\nA One-Dimensional Physically Universal Cellular Automaton<\/td>\n<\/tr>\n
11:30\u201312:00<\/td>\nElvira Mayordomo<\/em>
\nEffective exact Hausdorff dimension in general metric spaces<\/td>\n		Karoliina Lehtinen, Sandra Quickert<\/em>
\n$\\Sigma^{\\mu}_2$ is decidable for $\\Pi^{\\mu}_2$<\/td>\n		Martin Delacourt, Nicolas Ollinger<\/em>
\nPermutive one-way cellular automata and the finiteness problem for automaton groups<\/td>\n<\/tr>\n
12:00\u201312:30<\/td>\nChansu Park, Ji-Won Park, Sewon Park, Dongseong Seon, Martin Ziegler<\/em>
\nComputable Operations on Compact Subsets of Metric Spaces with Applications to Frechet Distance and Shape Optimization<\/td>\n		Nikolay Bazhenov, Mars Yamaleev<\/em>
\nDegrees of Categoricity of Rigid Structures<\/td>\n		Pavel Semukhin, Igor Potapov<\/em>
\nMembership Problem for 2\u00d72 nonsingilar integer matrices<\/td>\n<\/tr>\n
12:30\u201313:30<\/td>\nLunch<\/td>\n<\/tr>\n
13:30\u201315:00<\/td>\nTutorial, part 2: Computability theory, reverse mathematics, and combinatorial principles<\/b>
\nDenis Hirschfeldt <\/em><\/td>\n<\/tr>\n
15:00\u201315:30<\/td>\nCoffee<\/td>\n<\/tr>\n<\/tr>\n<\/td>\nWomen in Computability Workshop<\/strong><\/span><\/td>\n<\/tr>\n
15:30\u201316:00<\/td>\n\nJuliette Kennedy<\/em>\n<\/td>\n<\/tr>\n
16:00\u201316:30<\/td>\n\nKaren Lange<\/em>\n<\/td>\n<\/tr>\n
16:30\u201317:00<\/td>\n\nUrsula Martin<\/em>\n<\/td>\n<\/tr>\n
<\/td>\nBreak<\/td>\n<\/tr>\n
18:00\u201319:00<\/td>\nCity reception at the Town Hall<\/td>\n<\/tr>\n
19:00\u2013<\/td>\n\nWomen in Computability Dinner\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Wednesday, 14. June 2017<\/span><\/th>\n<\/tr>\n<\/thead>\n
9:00\u201310:00<\/td>\n Compressibility and probabilistic proofs<\/b>
\nAlexander Shen <\/em><\/td>\n<\/tr>\n
10:00\u201310:30<\/td>\nCoffee<\/td>\n<\/tr>\n
<\/td>\nContributed session 2<\/strong><\/span><\/td>\n<\/tr>\n
Room 1<\/td>\nRoom 2<\/td>\nRoom 3<\/td>\n<\/tr>\n
10:30\u201311:00<\/td>\nJoseph Almog, Vesa Halava<\/em>
\nTuring completeness, FOL completeness and definability<\/td>\n		Nikolay Bazhenov<\/em>
\nTuring computable embeddings, computable infinitary equivalence, and linear orders<\/td>\n		Akitoshi Kawamura, Holger Thies, Martin Ziegler<\/em>
\nAverage case complexity for the N-body problem<\/td>\n<\/tr>\n
11:00\u201311:30<\/td>\nPatrick Sibelius<\/em>
\nThe Axiom of Choice and Peano Arithmetic do not match<\/td>\n		Karoliina Lehtinen<\/em>
\nParity games and the modal mu alternation hierarchy<\/td>\n		Vladimir Aristov, Andrey Stroganov<\/em>
\nMethod of computer analogy: analytics and approximations<\/td>\n<\/tr>\n
11:30\u201312:00<\/td>\nRichard Whyman<\/em>
\nOn the Computation and Complexity of Arbitrary Physical Computers<\/td>\n		Luca San Mauro, Ekaterina Fokina, Dino Rossegger<\/em>
\n Bi-embeddability spectra of structures<\/td>\n		Lorenzo Galeotti, Hugo Nobrega<\/em>
\nTowards computable analysis on the generalised real line<\/td>\n<\/tr>\n
12:00\u201312:30<\/td>\nVasco Brattka, Rupert H\u00f6lzl, Rutger Kuyper<\/em>
\nMonte Carlo Computability<\/td>\n		Victor Selivanov and Mars Yamaleev<\/em>
\nExtending a Cooper\u2019s Theorem to $\\Delta^0_3$ Turing degrees<\/td>\n		Merlin Carl, Benedikt L\u00f6we, Benjamin Rin<\/em>
\nKoepke machines and satisfiability for infinitary propositional languages<\/td>\n<\/tr>\n
12:30\u201313:30<\/td>\nLunch<\/td>\n<\/tr>\n
<\/td>\nBreak<\/td>\n<\/tr>\n
15:00-<\/td>\nExcursion to Herrankukkaro and conference dinner<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Thursday, 15. June 2017<\/span><\/th>\n<\/tr>\n<\/thead>\n
9:00\u201310:00<\/td>\n The computational complexity of query answering under updates<\/b>
\nNicole Schweikardt<\/em><\/td>\n<\/tr>\n
10:00\u201310:30<\/td>\nCoffee<\/td>\n<\/tr>\n
<\/td>\nSpecial sessions<\/strong><\/span><\/td>\n<\/tr>\n
Room 1<\/td>\nRoom 2<\/td>\nRoom 3<\/td>\n<\/tr>\n
Algorithmics for biology 1<\/strong><\/td>\nCombinatorics and algorithmics on words 1<\/strong><\/td>\nFormal languages and automata theory 1<\/strong><\/td>\n<\/tr>\n
10:30\u201311:15<\/td>\nTobias Marschall<\/em>
\nA Guided Tour to Computational Haplotyping<\/td>\n		Stepan Holub<\/em>
\nFormalizing a Fragment of Combinatorics on Words<\/td>\n		Kai Salomaa <\/em>
\nState Complexity of Neighbourhoods of Regular Languages<\/td>\n<\/tr>\n
11:15\u201312:00<\/td>\nFabio Vandin<\/em>
\nAlgorithms for Cancer Mutation Networks<\/td>\n		Pascal Ochem<\/em>
\nPattern avoidance<\/td>\n		Martin Kutrib<\/em>
\nReversibility in Finite-State Devices<\/td>\n<\/tr>\n
12:00\u201313:30<\/td>\nLunch<\/td>\n<\/tr>\n
13:30\u201315:00<\/td>\nTutorial, part 1: Tutorial on Integer Linear Programming in Computational Biology<\/b>
\nDaniel Gusfield<\/em><\/td>\n<\/tr>\n
15:00\u201315:30<\/td>\nCoffee<\/td>\n<\/tr>\n
<\/td>\nSpecial sessions<\/strong><\/span><\/td>\n<\/tr>\n
Room 1<\/td>\nRoom 2<\/td>\nRoom 3<\/td>\n<\/tr>\n
Algorithmics for biology 2<\/strong><\/td>\nCombinatorics and algorithmics on words 2<\/strong><\/td>\nFormal languages and automata theory 2<\/strong><\/td>\n<\/tr>\n
15:30\u201316:15<\/td>\nGregory Kucherov<\/em>
\nModern algorithmic techniques for biosequence search<\/td>\n		Svetlana Puzynina<\/em>
\nOn variations of Morse and Hedlund theorem<\/td>\n		Thomas Colcombet<\/em>
\nHybrid-set-vector automata and gluing of categories<\/td>\n<\/tr>\n
16:15\u201317:00<\/td>\nGianluca Della Vedova<\/em>
\nCharacter-based Phylogeny Construction and its Application to Tumor Evolution<\/td>\n		Narad Rampersad<\/em>
\nFormulas with reversal<\/td>\n		Artur Jez<\/em>
\nRecompression: new approach to word equations<\/td>\n<\/tr>\n
<\/td>\nBreak<\/td>\n<\/tr>\n
17:15\u201319:00<\/td>\nGeneral Assembly<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Friday, 16. June 2017<\/span><\/th>\n<\/tr>\n<\/thead>\n
9:00\u201310:00<\/td>\nA Logical Revolution<\/b>
\nMoshe Vardi<\/em><\/td>\n<\/tr>\n
10:00\u201310:30<\/td>\nCoffee<\/td>\n<\/tr>\n
<\/td>\nContributed session 3<\/strong><\/span><\/td>\n<\/tr>\n
Room 1<\/td>\nRoom 2<\/td>\nRoom 3<\/td>\n<\/tr>\n
10:30\u201311:00<\/td>\nRobert Barish, Akira Suyama<\/em>
\nCounting Substrate Cycles in Topologically Restricted Metabolic Networks<\/td>\n		Iosif Petrakis<\/em>
\nMcShane-Whitney pairs<\/td>\n		Merlin Carl, Bruno Durand, Gregory Lafitte, Sabrina Ouazzani<\/em>
\nAdmissibles in gaps<\/td>\n<\/tr>\n
11:00\u201311:30<\/td>\nShilpa Garg and Tobias Moemke<\/em>
\nA PTAS for Gapless MEC<\/td>\n		Ethan McCarthy<\/em>
\nCototal enumeration degrees and the Turing degree spectra of minimal subshifts<\/td>\n		Merlin Carl, Philipp Schlicht<\/em>
\nThe recognizability strength of infinite time Turing machines with ordinal parameters<\/td>\n<\/tr>\n
11:30\u201312:00<\/td>\nStefan Arnold, Jacobo Toran<\/em>
\nA Deterministic Algorithm for Testing the Equivalence of Read-once Branching Programs with Small Discrepancy<\/td>\n		Kentaro Sato<\/em>
\nA study on complexity of winning strategy<\/td>\n		Oscar Defrain, Bruno Durand, Gregory Lafitte<\/em>
\nInfinite time busy beavers<\/td>\n<\/tr>\n
12:00\u201313:15<\/td>\nLunch<\/td>\n<\/tr>\n
13:15\u201314:45<\/td>\nTutorial, part 2: Tutorial on Integer Linear Programming in Computational Biology<\/b>
\nDaniel Gusfield<\/em><\/td>\n<\/tr>\n
14:45\u201315:00<\/td>\nBreak<\/td>\n<\/tr>\n
<\/td>\nContributed session 4<\/strong><\/span><\/td>\n<\/tr>\n
Room 1<\/td>\nRoom 2<\/td>\nRoom 3<\/td>\n<\/tr>\n
15:00\u201315:30<\/td>\nPetr Golovach, Matthew Johnson, Barnaby Martin, Daniel Paulusma, Anthony Stewart<\/em>
\nSurjective H-Colouring: New Hardness Results<\/td>\n		Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski<\/em>
\nNew bounds on the strength of some restrictions of Hindman\u2019s Theorem<\/td>\n		Claus Brillowski<\/em>
\nA Demonstration of Continuous Name-Binding and Global Information Storage<\/td>\n<\/tr>\n
15:30\u201316:00<\/td>\nDaniela Genova, Hendrik Jan Hoogeboom<\/em>
\nFinite Language Forbidding-Enforcing Systems<\/td>\n		Margarita Korovina, Oleg Kudinov<\/em>
\nOn Higher Effective Descriptive Set Theory<\/td>\n		Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot<\/em>
\nFlexible Indexing of Repetitive Collections<\/td>\n<\/tr>\n
16:00\u201316:30<\/td>\nErzs\u00e9bet Csuhaj-Varj\u00fa, Gy\u00f6rgy Vaszil<\/em>
\nStability Languages of Networks of Watson-Crick D0L Systems<\/td>\n		Alexandra Soskova<\/em>
\nStructural properties of spectra and $\\omega$-spectra<\/td>\n		Manon Stipulanti<\/em>
\nGeneralized Pascal triangles for binomial coefficients of finite words<\/td>\n<\/tr>\n
16:30\u201317:00<\/td>\nCoffee<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"

  \u00b4 Monday, 12. June 2017 8:30\u20139:15 Registration 9:15\u20139:30 Opening 9:30\u201310:30 Ramsey\u2019s theorem under a computable perspective Ludovic Patey 10:30\u201311:00 Coffee 11:00\u201312:30 Tutorial, part 1: Computability theory, reverse mathematics, and combinatorial principles Denis Hirschfeldt 12:30\u201313:30 Lunch 13:30\u201314:30 Dynamic and structural properties of the computably enumerable sets Karen Lange 14:30\u201315:00 Coffee Special sessions Room 1 Room … Continue reading Schedule<\/span> →<\/span><\/a><\/p>\n","protected":false},"author":9,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-1449","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/pages\/1449","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/users\/9"}],"replies":[{"embeddable":true,"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/comments?post=1449"}],"version-history":[{"count":66,"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/pages\/1449\/revisions"}],"predecessor-version":[{"id":1719,"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/pages\/1449\/revisions\/1719"}],"wp:attachment":[{"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/media?parent=1449"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}