Computable classifications of continuous, transducer, and regular functions

DOI10.1016/J.TCS.2025.115086MaRDI QIDQ7021857zbMATH OpenFDO

Authors Johanna N. Y. Franklin, Rupert Hölzl, Alexander Melnikov, Keng Meng Ng, Daniel Turetsky

Publication date 26 February 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115086

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Abstract and axiomatic computability and recursion theory (03D75) Banach spaces of continuous, differentiable or analytic functions (46E15)

Cites work

• A lightface analysis of the differentiability rank
• A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
• A tutorial on computable analysis
• Application of finite transducers to the specification of mappings and fractal sets
• Automatic presentations of structures
• Automatic structures: twenty years later
• Beyond the horizon of computability. 16th conference on computability in Europe, CiE 2020, Fisciano, Italy, June 29 -- July 3, 2020. Proceedings
• Computability and Noncomputability in Classical Analysis
• Computable completely decomposable groups
• Computable structures and operations on the space of continuous functions
• Computable topological groups and Pontryagin duality
• Denjoy, Demuth and density
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• scientific article; zbMATH DE number 3841819 (Why is no real title available?)
• scientific article; zbMATH DE number 5605134 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 193011 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 695608 (Why is no real title available?)
• scientific article; zbMATH DE number 2047478 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 7168153 (Why is no real title available?)
• scientific article; zbMATH DE number 3222151 (Why is no real title available?)
• scientific article; zbMATH DE number 4187807 (Why is no real title available?)
• Index sets and Scott sentences
• Index sets in computable analysis
• Interactions of computability and randomness
• Invariant descriptive set theory
• Local compactness for computable Polish metric spaces is ^1_1-complete
• Normal numbers and the Borel hierarchy
• On computable numbers, with an application to the Entscheidungsproblem.
• On computable numbers, with an application to the Entscheidungsproblem. A correction.
• On the 3-state Mealy automata over an \(m\)-symbol alphabet of growth order \([n^{\log n/2\log m}]\).
• ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
• On the normality of numbers to different bases
• On-Line Algorithms for Division and Multiplication
• Randomness and differentiability
• Real functions defined by transducers
• Real functions incrementally computable by finite automata
• Regular Real Analysis
• Second-order linear-time computability with applications to computable analysis
• Sequential Automatic Algebras
• Some characterizations of functions computable in on-line arithmetic
• The classification problem for compact computable metric spaces
• The isomorphism problem for torsion-free abelian groups is analytic complete
• The smallest Mealy automaton of intermediate growth.

This page was built for publication: Computable classifications of continuous, transducer, and regular functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021857)