Computing with Infinite Data

Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines

Autori: Daniel S. Graça and Ning Zhong
Pubblicato in: Computability, Numero 12(2), 2023, Pagina/e 117-144, ISSN 2211-3568
Editore: IOS Press
DOI: 10.3233/com-210381

Realizing semicomputable simplices by computable dynamical systems

Autori: Daniel Coronel; Alexander Frank; Mathieu Hoyrup; Cristóbal Rojas
Pubblicato in: Theoretical Computer Science, Numero 933, 2022, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2022.09.001

Bi-topological spaces and the Continuity Problem

Autori: Dieter Spreen
Pubblicato in: Topology Proceedings, Numero 61, 2021, Pagina/e 77-99, ISSN 2331-1290
Editore: Topology Proceedings

Elementary Quotient Completions, Church's Thesis, and Partioned Assemblies

Autori: Maria Emilia Maietti, Fabio Pasquali, Giuseppe Rosolini
Pubblicato in: Logical Methods in Computer Science, 2019, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-15(2:21)2019

A realizability semantics for inductive formal topologies, Church'sThesis and Axiom of Choice

Autori: Maria Emilia Maietti, Samuele Maschio, Michael Rathjen
Pubblicato in: Logical Methods in Computer Science, 2021, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-17(2:21)2021

The ksmt Calculus Is a δ-complete Decision Procedure for Non-linear Constraints

Autori: Franz Brauße, Konstantin Korovin, Margarita Korovina, Norbert Müller
Pubblicato in: Theoretical Computer Science, 2023, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2023.114125

Logic for exact real arithmetic

Autori: Helmut Schwichtenberg, Franziskus Wiesnet
Pubblicato in: Logical Methods in Computer Science, Numero 17, 2021, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-17(2:7)2021

Computing the exact number of periodic orbits for planar flows

Autori: Daniel S. Graça and Ning Zhong
Pubblicato in: Transactions of the American Mathematical Society, Numero 375, 2022, Pagina/e 5491-5538, ISSN 0002-9947
Editore: American Mathematical Society
DOI: 10.1090/tran/8644

The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable

Autori: Daniel S. Graça and Ning Zhong
Pubblicato in: Theoretical Computer Science, Numero 895, 2021, Pagina/e 48-54, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2021.09.028

McShane-Whitney extensions in constructive analysis

Autori: Iosif Petrakis
Pubblicato in: Logical Methods in Compuer Science, 2020, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-16(1:18)2020

OVERLAP ALGEBRAS: A CONSTRUCTIVE LOOK AT COMPLETE BOOLEAN ALGEBRAS

Autori: FRANCESCO CIRAULO, MICHELE CONTENTE
Pubblicato in: Logical Methods in Computer Science, 2020, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-16(1:13)2020

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

Autori: Svetlana Selivanova, Victor Selivanov
Pubblicato in: Logical Methods in Computer Science, Numero Volume 13, Numero 4, 2017, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.23638/LMCS-13(4:13)2017

On the functions generated by the general purpose analog computer

Autori: Olivier Bournez, Daniel Graça, Amaury Pouly
Pubblicato in: Information and Computation, Numero 257, 2017, Pagina/e 34-57, ISSN 0890-5401
Editore: Academic Press
DOI: 10.1016/j.ic.2017.09.015

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

Autori: Olivier Bournez, Daniel S. Graça, Amaury Pouly
Pubblicato in: Journal of the ACM, Numero 64/6, 2017, Pagina/e 1-76, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3127496

Complexity for partial computable functions over computable Polish spaces

Autori: MARGARITA KOROVINA, OLEG KUDINOV
Pubblicato in: Mathematical Structures in Computer Science, Numero 28/3, 2018, Pagina/e 429-447, ISSN 0960-1295
Editore: Cambridge University Press
DOI: 10.1017/s0960129516000438

Computable elements and functions in effectively enumerable topological spaces

Autori: MARGARITA KOROVINA, OLEG KUDINOV
Pubblicato in: Mathematical Structures in Computer Science, Numero 27/8, 2017, Pagina/e 1466-1494, ISSN 0960-1295
Editore: Cambridge University Press
DOI: 10.1017/s0960129516000141

The Rice-Shapiro theorem in Computable Topology

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

Overt choice

Autori: Matthew de Brecht, Arno Pauly, Matthias Schröder
Pubblicato in: Computability, Numero 9/3-4, 2020, Pagina/e 169-191, ISSN 2211-3576
Editore: IOS Press
DOI: 10.3233/com-190253

The principle of pointfree continuity

Autori: Tatsuji Kawai, Giovanni Sambin
Pubblicato in: Logical Methods in Computer Science, Numero 15, 2019, Pagina/e 1--22, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-15(1:22)2019

SEARCHING FOR AN ANALOGUE OF ATR 0 IN THE WEIHRAUCH LATTICE

Autori: TAKAYUKI KIHARA, ALBERTO MARCONE, ARNO PAULY
Pubblicato in: The Journal of Symbolic Logic, Numero 85/3, 2020, Pagina/e 1006-1043, ISSN 0022-4812
Editore: Association for Symbolic Logic
DOI: 10.1017/jsl.2020.12

The Ho-Zhao Problem

Autori: Weng Kin Ho, Jean Goubault-Larrecq, Achim Jung, Xiaoyong Xi
Pubblicato in: Logical Methods in Computer Science, Numero 14 (1:7), 2018, Pagina/e 1--19, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-14(1:7)2018

Topological Scott Convergence Theorem

Autori: Hadrian Andradi, Weng Kin Ho
Pubblicato in: Logical Methods in Computer Science, Numero 15-1, 2019, Pagina/e 1-14, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-15(1:29)2019

Behavioural Equivalence via Modalities for Algebraic Effects

Autori: Alex Simpson, Niels Voorneveld
Pubblicato in: ACM Transactions on Programming Languages and Systems (TOPLAS), Numero 42/1, 2020, Pagina/e 1-45, ISSN 0164-0925
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3363518

Inductive and Coinductive Topological Generation with Church's thesis and the Axiom of Choice

Autori: Maria Emilia Maietti, Samuele Maschio, Michael Rathjen
Pubblicato in: Logical Methods in Computer Science, 2022, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-18(4:5)2022

Factorizing the Top-Loc adjunction through positive topologies

Autori: F. Ciraulo, T. Kawai, S. Maschio
Pubblicato in: Archive for Mathematical Logic, 2021, ISSN 0933-5846
Editore: Springer Verlag
DOI: 10.1007/s00153-021-00768-5

Direct spectra of Bishop spaces and teir limits

Autori: Iosif Petrakis
Pubblicato in: Logical Methods in Computer Science, 2020, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig

Computing with continuous objects: a uniform co-inductive approach

Autori: Dieter Spreen
Pubblicato in: Mathematical Structures in Computer Science, Numero 31, Numero 2, 2021, Pagina/e 144-192, ISSN 1469-8072
Editore: Cambridge University Press
DOI: 10.1017/s0960129521000116

A characterization of generalized existential completions

Autori: Maria Emilia Maietti, Davide Trotta
Pubblicato in: Annals of Pure and Applied Logic, 2023, ISSN 0168-0072
Editore: Elsevier BV
DOI: 10.1016/j.apal.2022.103234

Limits of real numbers in the binary signed digit representation

Autori: Franziskus Wiesnet, Nils Köpp
Pubblicato in: Log. Methods Comput. Sci., 2022, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.48550/arxiv.2103.15702

σ-locales in Formal Topology

Autori: F. Ciraulo
Pubblicato in: Logical Methods in Computer Science, 2022, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-18(1:7)2022

Natural density and probability, constructively

Autori: Samuele Maschio
Pubblicato in: Reports on Mathematical Logic, 2020, ISSN 0137-2904
Editore: Jagiellonian University
DOI: 10.4467/20842589rm.20.002.12434

Computing Haar Measures

Autori: Pauly, Arno; Seon, Dongseong; Ziegler, Martin
Pubblicato in: Proceedings of CSL 2020, Numero 26, 2020
Editore: Lipics
DOI: 10.4230/lipics.csl.2020.34

Computability of Ordinary Differential Equations

Autori: D. S. Graça, N. Zhong
Pubblicato in: Proceedings of the 14th Conference on Computability in Europe, CiE 2018: Sailing Routes in the World of Computation, Numero Volume 10936 of Lecture Notes in Computer Science, 2018, Pagina/e 204-213, ISBN 978-3-319-94417-3
Editore: Springer

Computability on quasi-Polish spaces

Autori: Mathieu Hoyrup, Cristobal Rojas, Victor Selivanov, Donald M. Stull
Pubblicato in: Descriptional Complexity of Formal Systems - 21st {IFIP} {WG} 1.02 International Conference, {DCFS} 2019, Ko{\v{s}}ice, Slovakia, July 17-19, 2019, Proceedings, 2019, Pagina/e 171-183
Editore: Springer
DOI: 10.1007/978-3-030-23247-4_13

Average-Case Polynomial-Time Computability of Hamiltonian Dynamics

Autori: Akitoshi Kawamura, Holger Thies, Martin Ziegler
Pubblicato in: Leibniz International Proceedings in Informatics (LIPIcs), 2018, Pagina/e 30:1--30:17
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.mfcs.2018.30

Behavioural equivalence via modalities for algebraic effects

Autori: Alex Simpson, Niels Voorneveld
Pubblicato in: Lecture Notes in Computer Science, Numero 10809, 2018, Pagina/e 300--326, ISBN 978-3-319-89884-1
Editore: Springer

Displayed categories

Autori: Benedikt Ahrens, Peter LeFanu Lumsdaine
Pubblicato in: Leibniz International Proceedings in Informatics, Numero 84, 2017, Pagina/e 5:1--5:16, ISBN 978-3-95977-047-7
Editore: Leibniz Zentrum für Informatik, Dagstuhl Publishing
DOI: 10.4230/lipics.fscd.2017.0

Tunneling on Wheeler Graphs

Autori: Jarno Alanko, Travis Gagie, Gonzalo Navarro, Louisa Seelbach Benkner
Pubblicato in: 2019 Data Compression Conference (DCC), 2019, Pagina/e 122-131, ISBN 978-1-7281-0657-1
Editore: IEEE
DOI: 10.1109/dcc.2019.00020

Computable Analysis for Verified Exact Real Computation

Autori: Konecny, Michal; Steinberg, Florian; Thies, Holger
Pubblicato in: Leibniz International Proceedings in Informatics (LIPIcs), Numero 182, 2020, Pagina/e 50:1-50:18
Editore: Schloss Dagstuhl-Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.fsttcs.2020.50

On the Collection of Fringe Subtrees in Random Binary Trees

Autori: Louisa Seelbach Benkner, Stephan Wagner
Pubblicato in: Lecture Notes in Computer Science, Numero 12118, 2020, Pagina/e 546-558, ISBN 978-3-030-61791-2
Editore: Springer, Cham
DOI: 10.1007/978-3-030-61792-9_43

Computing with Infinite Objects: the Gray Code Case

Autori: Dieter Spreen, Ulrich Berger
Pubblicato in: Logical Methods in Computer Science, Numero 19, issue 3, 2023, Pagina/e 1:1 - 1:62, ISSN 1860-5974
Editore: LOGICAL METHODS IN COMPUTER SCIENCE e.V.
DOI: 10.48550/arxiv.2105.14261

σ-locales and Booleanization in Formal Topology

Autori: Francesco Ciraulo
Pubblicato in: 2019
Editore: Cornell University

Overlap Algebras as Almost Discrete Locales

Autori: Francesco Ciraulo
Pubblicato in: 2016
Editore: Cornell University

Representations and evaluation strategies for feasibly approximable functions

Autori: Michal Konecny, Eike Neumann
Pubblicato in: 2018
Editore: Cornell University

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

Autori: Maria Emilia Maietti, Fabio Pasquali, Giuseppe Rosolini
Pubblicato in: 2018
Editore: Cornell University

Enumeration degrees and non-metrizable topology

Autori: Takayuki Kihara, Arno Pauly
Pubblicato in: 2019
Editore: Cornell University

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

Autori: 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
Pubblicato in: 2019
Editore: Cornell University

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

Autori: Eike Neumann
Pubblicato in: 2018
Editore: Cornell University

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

Autori: Eike Neumann, Florian Steinberg
Pubblicato in: 2017
Editore: Cornell University

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

Autori: Akitoshi Kawamura, Donghyun Lim, Svetlana Selivanova, Martin Ziegler
Pubblicato in: 2018
Editore: Cornell University

Natural density and probability, constructively

Autori: Samuele Maschio
Pubblicato in: 2019
Editore: Cornell University

On Formal Verification in Imperative Multivalued Programming over Continuous Data Types

Autori: Gyesik Lee, Norbert Müller, Eike Neumann, Sewon Park, Norbert Preining, Martin Ziegler
Pubblicato in: 2019
Editore: Cornell University

Weak Reduction Principle and Computable Metric Spaces

Autori: Margarita Korovina, Oleg Kudinov
Pubblicato in: Sailing Routes in the World of Computation, Numero 10936, 2018, Pagina/e 234-243, ISBN 978-3-319-94417-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-94418-0_24

Outline of Partial Computability in Computable Topology

Autori: Margarita Korovina, Oleg Kudinov
Pubblicato in: Unveiling Dynamics and Complexity, Numero 10307, 2017, Pagina/e 64-76, ISBN 978-3-319-58740-0
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-58741-7_7

On Higher Effective Descriptive Set Theory

Autori: Margarita Korovina, Oleg Kudinov
Pubblicato in: Unveiling Dynamics and Complexity, Numero 10307, 2017, Pagina/e 282-291, ISBN 978-3-319-58740-0
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-58741-7_27

Extending Wadge Theory to k-Partitions

Autori: Victor L. Selivanov
Pubblicato in: Unveiling Dynamics and Complexity, Numero 10307, 2017, Pagina/e 387-399, ISBN 978-3-319-58740-0
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-58741-7_36

Behavioural Equivalence via Modalities for Algebraic Effects

Autori: Alex Simpson, Niels Voorneveld
Pubblicato in: Programming Languages and Systems, Numero 10801, 2018, Pagina/e 300-326, ISBN 978-3-319-89883-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-89884-1_11

Undecidability of Equality for Codata Types

Autori: Ulrich Berger, Anton Setzer
Pubblicato 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, Numero 11202, 2018, Pagina/e 34-55, ISBN 978-3-030-00388-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-00389-0_4

Highlights of the Rice-Shapiro Theorem in Computable Topology

Autori: Margarita Korovina, Oleg Kudinov
Pubblicato in: Perspectives of System Informatics, Numero 10742, 2018, Pagina/e 241-255, ISBN 978-3-319-74312-7
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-74313-4_18

Computability of Limit Sets for Two-Dimensional Flows

Autori: Daniel S. Graça and Ning Zhong
Pubblicato in: Lecture Notes in Computer Science, Numero 12813, 2021, Pagina/e 494-503, ISBN 978-3-030-80048-2
Editore: Springer
DOI: 10.1007/978-3-030-80049-9_48

Finite Choice, Convex Choice and Sorting

Autori: Takayuki Kihara, Arno Pauly
Pubblicato in: Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings, Numero 11436, 2019, Pagina/e 378-393, ISBN 978-3-030-14811-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-14812-6_23

Computability of differential equations

Autori: Graça, Daniel; Zhong, Ning
Pubblicato in: Handbook of Computability and Complexity in Analysis, Numero 15, 2021, Pagina/e 71-99, ISBN 978-3-030-59233-2
Editore: Springer

Risultati finali

Pubblicazioni

Condividi questa pagina

Scarica