Skip to main content

Computing with Infinite Data

Deliverables

Project Web Site

An internet web page will be set up and maintained. It will inform the public about project events and important research achievements, but also provide an internal discussion platform.

Mid-term meeting

Organisation of mid-term meeting between consortium and project officer.

IPR Training

Training on Intellectual Property Rights.

Searching for OpenAIRE data...

Publications

Generalised information systems capture L-domains

Author(s): Dieter Spreen
Published in: Theoretical Computer Science, 2021, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2020.12.044

Combinatorial principles equivalent to weak induction

Author(s): Caleb Davis, Denis R. Hirschfeldt, Jeffry Hirst, Jake Pardo, Arno Pauly, Keita Yokoyama
Published in: Computability, 9/3-4, 2020, Page(s) 219-229, ISSN 2211-3576
Publisher: IOS Press
DOI: 10.3233/com-180244

Logic for exact real arithmetic

Author(s): Helmut Schwichtenberg, Franziskus Wiesnet
Published in: Logical Methods in Computer Science, 17, 2021, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-17(2:7)2021

Ramsey’s theorem and products in the Weihrauch degrees

Author(s): Damir D. Dzhafarov, Jun Le Goh, Denis R. Hirschfeldt, Ludovic Patey, Arno Pauly
Published in: Computability, 9/2, 2020, Page(s) 85-110, ISSN 2211-3576
Publisher: IOS Press
DOI: 10.3233/com-180203

A coinductive approach to computing with compact sets

Author(s): Ulrich Berger, Dieter Spreen
Published in: Journal of Logic and Analysis, 8, 2016, Page(s) 1-35, ISSN 1759-9008
Publisher: Department of Mathematics, The University of York
DOI: 10.4115/jla.2016.8.3

A Syntactic Approach to Contnuity of T-definable Functionals

Author(s): Chuangjie Xu
Published in: Logical Methods in Computer Science, 2021, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-16(1:22)2020

FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS

Author(s): JUN LE GOH, ARNO PAULY, MANLIO VALENTI
Published in: The Journal of Symbolic Logic, 2021, Page(s) 1-39, ISSN 0022-4812
Publisher: Association for Symbolic Logic
DOI: 10.1017/jsl.2021.15

McShane-Whitney extensions in constructive analysis

Author(s): Iosif Petrakis
Published in: Logical Methods in Compuer Science, 2020, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-16(1:18)2020

Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs

Author(s): Svetlana Selivanova, Victor Selivanov
Published in: Logical Methods in Computer Science, Volume 13, Issue 4, 2017, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.23638/LMCS-13(4:13)2017

On the functions generated by the general purpose analog computer

Author(s): Olivier Bournez, Daniel Graça, Amaury Pouly
Published in: Information and Computation, 257, 2017, Page(s) 34-57, ISSN 0890-5401
Publisher: Academic Press
DOI: 10.1016/j.ic.2017.09.015

Computing geometric Lorenz attractors with arbitrary precision

Author(s): D. S. Graça, C. Rojas, N. Zhong
Published in: Transactions of the American Mathematical Society, 370/4, 2018, Page(s) 2955-2970, ISSN 0002-9947
Publisher: American Mathematical Society
DOI: 10.1090/tran/7228

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length

Author(s): Olivier Bournez, Daniel S. Graça, Amaury Pouly
Published in: Journal of the ACM, 64/6, 2017, Page(s) 1-76, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3127496

Complexity for partial computable functions over computable Polish spaces

Author(s): MARGARITA KOROVINA, OLEG KUDINOV
Published in: Mathematical Structures in Computer Science, 28/3, 2018, Page(s) 429-447, ISSN 0960-1295
Publisher: Cambridge University Press
DOI: 10.1017/s0960129516000438

Computable elements and functions in effectively enumerable topological spaces

Author(s): MARGARITA KOROVINA, OLEG KUDINOV
Published in: Mathematical Structures in Computer Science, 27/8, 2017, Page(s) 1466-1494, ISSN 0960-1295
Publisher: Cambridge University Press
DOI: 10.1017/s0960129516000141

The Rice-Shapiro theorem in Computable Topology

Author(s): Korovina, Margarita and Kudinov, Oleg
Published in: Logical methods in computer science, 2017, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-13(4:30)2017

Embedding locales and formal topologies into positive topologies

Author(s): Francesco Ciraulo, Giovanni Sambin
Published in: Archive for Mathematical Logic, 57/7-8, 2018, Page(s) 755-768, ISSN 0933-5846
Publisher: Springer Verlag
DOI: 10.1007/s00153-017-0605-0

Overt choice

Author(s): Matthew de Brecht, Arno Pauly, Matthias Schröder
Published in: Computability, 9/3-4, 2020, Page(s) 169-191, ISSN 2211-3576
Publisher: IOS Press
DOI: 10.3233/com-190253

The principle of pointfree continuity

Author(s): Tatsuji Kawai, Giovanni Sambin
Published in: Logical Methods in Computer Science, 15, 2019, Page(s) 1--22, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-15(1:22)2019

SEARCHING FOR AN ANALOGUE OF ATR 0 IN THE WEIHRAUCH LATTICE

Author(s): TAKAYUKI KIHARA, ALBERTO MARCONE, ARNO PAULY
Published in: The Journal of Symbolic Logic, 85/3, 2020, Page(s) 1006-1043, ISSN 0022-4812
Publisher: Association for Symbolic Logic
DOI: 10.1017/jsl.2020.12

Hyper Natural Deduction for Gödel Logic—A natural deduction system for parallel reasoning

Author(s): Arnold Beckmann, Norbert Preining
Published in: Journal of Logic and Computation, 28/6, 2018, Page(s) 1125-1187, ISSN 0955-792X
Publisher: Oxford University Press
DOI: 10.1093/logcom/exy019

A topological view on algebraic computation models

Author(s): Eike Neumann, Arno Pauly
Published in: Journal of Complexity, 44, 2018, Page(s) 1-22, ISSN 0885-064X
Publisher: Academic Press
DOI: 10.1016/j.jco.2017.08.003

Computability in basic quantum mechanics

Author(s): Eike Neumann, Martin Pape, Thomas Streicher
Published in: Logical Methods in Computer Science, 14-2, 2018, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-14(2:14)2018

Weihrauch-completeness for layerwise computability

Author(s): Arno Pauly, Willem Fouché, George Davie
Published in: Logical Methods in Computer Science, 14-2, 2018, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-14(2:11)2018

The Ho-Zhao Problem

Author(s): Weng Kin Ho, Jean Goubault-Larrecq, Achim Jung, Xiaoyong Xi
Published in: Logical Methods in Computer Science, 14 (1:7), 2018, Page(s) 1--19, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-14(1:7)2018

Topological Scott Convergence Theorem

Author(s): Hadrian Andradi, Weng Kin Ho
Published in: Logical Methods in Computer Science, 15-1, 2019, Page(s) 1-14, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-15(1:29)2019

Behavioural Equivalence via Modalities for Algebraic Effects

Author(s): Alex Simpson, Niels Voorneveld
Published in: ACM Transactions on Programming Languages and Systems (TOPLAS), 42/1, 2020, Page(s) 1-45, ISSN 0164-0925
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3363518

LUZIN’S (N) AND RANDOMNESS REFLECTION

Author(s): ARNO PAULY, LINDA WESTRICK, LIANG YU
Published in: The Journal of Symbolic Logic, 2020, Page(s) 1-26, ISSN 0022-4812
Publisher: Association for Symbolic Logic
DOI: 10.1017/jsl.2020.73

Computing with continuous objects: a uniform co-inductive approach

Author(s): Dieter Spreen
Published in: Mathematical Structures in Computer Science, 31, Issue 2, 2021, Page(s) 144-192, ISSN 1469-8072
Publisher: Cambridge University Press
DOI: 10.1017/s0960129521000116

The fixed-point property for represented spaces

Author(s): Mathieu Hoyrup
Published in: Annals of Pure and Applied Logic, 2022, ISSN 0168-0072
Publisher: Elsevier BV
DOI: 10.1016/j.apal.2022.103090

Projection operators in the Weihrauch lattice

Author(s): Guido Gherardi, Alberto Marcone, Arno Pauly
Published in: Computability, 8/3-4, 2019, Page(s) 281-304, ISSN 2211-3576
Publisher: IOS Press
DOI: 10.3233/com-180207

Connected choice and the Brouwer fixed point theorem

Author(s): Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly
Published in: Journal of Mathematical Logic, 19/01, 2019, Page(s) 1950004, ISSN 0219-0613
Publisher: Singapore University Press
DOI: 10.1142/s0219061319500041

Computing Haar Measures

Author(s): Pauly, Arno; Seon, Dongseong; Ziegler, Martin
Published in: Proceedings of CSL 2020, 26, 2020
Publisher: Lipics
DOI: 10.4230/lipics.csl.2020.34

Connecting Constructive Notions of Ordinals in Homotopy Type Theory

Author(s): Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu
Published in: MFCS 2021, 2021
Publisher: Leibniz Center for Informatics
DOI: 10.4230/lipics.mfcs.2021.42

Three equivalent ordinal notation systems in cubical Agda

Author(s): Fredrik Nordvall Forsberg, Chuangjie Xu, Neil Ghani
Published in: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020, Page(s) 172-185, ISBN 9781450370974
Publisher: ACM
DOI: 10.1145/3372885.3373835

A Gentzen-style Monadic Translation of Gödel's System T

Author(s): Chuangjie Xu
Published in: FSCD 2020, 2020
Publisher: Leibniz Center for Informatics
DOI: 10.4230/lipics.fscd.2020.25

Computability of Ordinary Differential Equations

Author(s): D. S. Graça, N. Zhong
Published in: Proceedings of the 14th Conference on Computability in Europe, CiE 2018: Sailing Routes in the World of Computation, Volume 10936 of Lecture Notes in Computer Science, 2018, Page(s) 204-213, ISBN 978-3-319-94417-3
Publisher: Springer

Eating Pizza to learn fractions

Author(s): Ombretta Gaggi, Francesco Ciraulo, Marco Casagrande
Published in: Proceedings of the 4th EAI International Conference on Smart Objects and Technologies for Social Good - Goodtechs '18, 2018, Page(s) 220-225, ISBN 9781-450365819
Publisher: ACM Press
DOI: 10.1145/3284869.3284921

Average-Case Polynomial-Time Computability of Hamiltonian Dynamics

Author(s): Akitoshi Kawamura, Holger Thies, Martin Ziegler
Published in: Leibniz International Proceedings in Informatics (LIPIcs), 2018, Page(s) 30:1--30:17
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.mfcs.2018.30

Behavioural equivalence via modalities for algebraic effects

Author(s): Alex Simpson, Niels Voorneveld
Published in: Lecture Notes in Computer Science, 10809, 2018, Page(s) 300--326, ISBN 978-3-319-89884-1
Publisher: Springer

Displayed categories

Author(s): Benedikt Ahrens, Peter LeFanu Lumsdaine
Published in: Leibniz International Proceedings in Informatics, 84, 2017, Page(s) 5:1--5:16, ISBN 978-3-95977-047-7
Publisher: Leibniz Zentrum für Informatik, Dagstuhl Publishing
DOI: 10.4230/lipics.fscd.2017.0

Tunneling on Wheeler Graphs

Author(s): Jarno Alanko, Travis Gagie, Gonzalo Navarro, Louisa Seelbach Benkner
Published in: 2019 Data Compression Conference (DCC), 2019, Page(s) 122-131, ISBN 978-1-7281-0657-1
Publisher: IEEE
DOI: 10.1109/dcc.2019.00020

On the Collection of Fringe Subtrees in Random Binary Trees

Author(s): Louisa Seelbach Benkner, Stephan Wagner
Published in: Lecture Notes in Computer Science, 12118, 2020, Page(s) 546-558, ISBN 978-3-030-61791-2
Publisher: Springer, Cham
DOI: 10.1007/978-3-030-61792-9_43

Descriptive Complexity on Non-Polish Spaces

Author(s): Antonin Callard, Mathieu Hoyrup
Published in: 2020
Publisher: Schloss Dagstuhl--Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2020.8

Descriptive Complexity on Non-Polish Spaces II

Author(s): Mathieu Hoyrup
Published in: 2020
Publisher: Schloss Dagstuhl--Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2020.132

Computing with Infinite Objects: the Gray Code Case

Author(s): Dieter Spreen, Ulrich Berger
Published in: 2021
Publisher: Cornell University

Bi-topological spaces and the Continuity Problem

Author(s): Dieter Spreen
Published in: 2021
Publisher: Cornell University

Factorizing the Top-Loc adjunction through positive topologies

Author(s): Francesco Ciraulo, Tatsuji Kawai, Samuele Maschio
Published in: 2018
Publisher: Cornell University

A predicative variant of Hyland's Effective Topos

Author(s): Maria Emilia Maietti, Samuele Maschio
Published in: 2018
Publisher: Cornell University

σ-locales and Booleanization in Formal Topology

Author(s): Francesco Ciraulo
Published in: 2019
Publisher: Cornell University

Reducibility, a constructive dual of spatiality

Author(s): F. Ciraulo - G. Sambin
Published in: Journal of Logic and Analysis, 2019
Publisher: Carnegie Mellon University

Overlap Algebras as Almost Discrete Locales

Author(s): Francesco Ciraulo
Published in: 2016
Publisher: Cornell University

Representations and evaluation strategies for feasibly approximable functions

Author(s): Michal Konecny, Eike Neumann
Published in: 2018
Publisher: Cornell University

Computability on quasi-Polish spaces

Author(s): Mathieu Hoyrup, Cristobal Rojas, Victor Selivanov, Donald M. Stull
Published in: 2019
Publisher: Cornell University

Elementary quotient completions, Church's Thesis, and partitioned assemblies

Author(s): Maria Emilia Maietti, Fabio Pasquali, Giuseppe Rosolini
Published in: 2018
Publisher: Cornell University

Enumeration degrees and non-metrizable topology

Author(s): Takayuki Kihara, Arno Pauly
Published in: 2019
Publisher: Cornell University

Results in descriptive set theory on some represented spaces

Author(s): Mathieu Hoyrup
Published in: 2019
Publisher: Cornell University

A minimal representation of continuous functions

Author(s): Franz Brauße, Florian Steinberg
Published in: 2018
Publisher: Cornell University

"Semantics, logic and verification of ""exact real computation"""

Author(s): Franz Brauße, Pieter Collins, Johannes Kanig, SunYoung Kim, Michal Konečný, Gyesik Lee, Norbert Müller, Eike Neumann, Sewon Park, Norbert Preining, Martin Ziegler
Published in: 2019
Publisher: Cornell University

On the computability of the Fréchet distance of surfaces in thwe bitmodel of real computation

Author(s): Eike Neumann
Published in: 2018
Publisher: Cornell University

Parameterised second-order complexity theory with applications to the study of interval computation

Author(s): Eike Neumann, Florian Steinberg
Published in: 2017
Publisher: Cornell University

Representation Theory of Compact Metric Spaces and Computational Complexity of Continuous Data

Author(s): Akitoshi Kawamura, Donghyun Lim, Svetlana Selivanova, Martin Ziegler
Published in: 2018
Publisher: Cornell University

Natural density and probability, constructively

Author(s): Samuele Maschio
Published in: 2019
Publisher: Cornell University

A syntactic approach to continuity of T-definable functionals

Author(s): Chuangjie Xu
Published in: 2019
Publisher: Cornell University

On Formal Verification in Imperative Multivalued Programming over Continuous Data Types

Author(s): Gyesik Lee, Norbert Müller, Eike Neumann, Sewon Park, Norbert Preining, Martin Ziegler
Published in: 2019
Publisher: Cornell University

Computability of Ordinary Differential Equations

Author(s): Daniel S. Graça, Ning Zhong
Published in: Sailing Routes in the World of Computation, 10936, 2018, Page(s) 204-213, ISBN 978-3-319-94417-3
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-94418-0_21

Topological Analysis of Representations

Author(s): Mathieu Hoyrup
Published in: Sailing Routes in the World of Computation, 10936, 2018, Page(s) 214-223, ISBN 978-3-319-94417-3
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-94418-0_22

Weak Reduction Principle and Computable Metric Spaces

Author(s): Margarita Korovina, Oleg Kudinov
Published in: Sailing Routes in the World of Computation, 10936, 2018, Page(s) 234-243, ISBN 978-3-319-94417-3
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-94418-0_24

Outline of Partial Computability in Computable Topology

Author(s): Margarita Korovina, Oleg Kudinov
Published in: Unveiling Dynamics and Complexity, 10307, 2017, Page(s) 64-76, ISBN 978-3-319-58740-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-58741-7_7

On Higher Effective Descriptive Set Theory

Author(s): Margarita Korovina, Oleg Kudinov
Published in: Unveiling Dynamics and Complexity, 10307, 2017, Page(s) 282-291, ISBN 978-3-319-58740-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-58741-7_27

Extending Wadge Theory to k-Partitions

Author(s): Victor L. Selivanov
Published in: Unveiling Dynamics and Complexity, 10307, 2017, Page(s) 387-399, ISBN 978-3-319-58740-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-58741-7_36

On Choice Rules in Dependent Type Theory

Author(s): Maria Emilia Maietti
Published in: Theory and Applications of Models of Computation, 10185, 2017, Page(s) 12-23, ISBN 978-3-319-55910-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-55911-7_2

Behavioural Equivalence via Modalities for Algebraic Effects

Author(s): Alex Simpson, Niels Voorneveld
Published in: Programming Languages and Systems, 10801, 2018, Page(s) 300-326, ISBN 978-3-319-89883-4
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-89884-1_11

Optimized Program Extraction for Induction and Coinduction

Author(s): Ulrich Berger, Olga Petrovska
Published in: Sailing Routes in the World of Computation, 10936, 2018, Page(s) 70-80, ISBN 978-3-319-94417-3
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-94418-0_7

Undecidability of Equality for Codata Types

Author(s): Ulrich Berger, Anton Setzer
Published in: Coalgebraic Methods in Computer Science - 14th IFIP WG 1.3 International Workshop, CMCS 2018, Colocated with ETAPS 2018, Thessaloniki, Greece, April 14–15, 2018, Revised Selected Papers, 11202, 2018, Page(s) 34-55, ISBN 978-3-030-00388-3
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-00389-0_4

Highlights of the Rice-Shapiro Theorem in Computable Topology

Author(s): Margarita Korovina, Oleg Kudinov
Published in: Perspectives of System Informatics, 10742, 2018, Page(s) 241-255, ISBN 978-3-319-74312-7
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-74313-4_18

Finite Choice, Convex Choice and Sorting

Author(s): Takayuki Kihara, Arno Pauly
Published in: Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings, 11436, 2019, Page(s) 378-393, ISBN 978-3-030-14811-9
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-14812-6_23

Computability of differential equations

Author(s): Graça, Daniel; Zhong, Ning
Published in: Handbook of Computability and Complexity in Analysis, 15, 2021, Page(s) 71-99, ISBN 978-3-030-59233-2
Publisher: Springer