On finite-time computability preserving conversions

DOI10.1016/J.ENTCS.2008.12.025MaRDI QIDQ4918023zbMATH OpenOpenAlexFDO

Authors Hideki Tsuiki, Shuji Yamada

Publication date 3 May 2013

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

Full work available at URL https://doi.org/10.1016/j.entcs.2008.12.025

zbMATH Keywords

computable analysisconstant-time computable functionsdomain theoryfinite-time computable functionssliding block functions

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 5622695
• Real functions computable by finite automata using affine representations.
• Functions and functional on finite systems
• Predicatively computable functions on sets
• Finite Automata Computing Real Functions

Cites work

• An Introduction to Symbolic Dynamics and Coding
• Continuous Lattices and Domains
• scientific article; zbMATH DE number 107999 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• Real number computation through Gray code embedding.

Cited in

(1)

• scientific article; zbMATH DE number 5622695 (Why is no real title available?)

This page was built for publication: On finite-time computability preserving conversions

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