Some characterizations of functions computable in on-line arithmetic

DOI10.1109/12.286308MaRDI QIDQ4420054zbMATH OpenOpenAlexFDO

Authors Jean-Michel Muller

Publication date 1994

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.286308

zbMATH Keywords

computer arithmeticfinite automata

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Formal languages and automata (68Q45)

Recommendations

• On the linearity of on-line computable functions
• On the complexity of online computations of real functions
• A new characterization of computable functions
• On classes of computable functions
• scientific article; zbMATH DE number 3979140
• On some computability notions for real functions
• On the problem of computational time and complexity of arithmetic functions
• scientific article; zbMATH DE number 1512850
• scientific article; zbMATH DE number 4115977

Cited in

(13)

• Deterministic synchronization of automata with bounded delay
• On the complexity of online computations of real functions
• Online computations of differentiable functions
• On the linearity of on-line computable functions
• On-line digit set conversion in real base.
• A tetrachotomy for expansions of the real ordered additive group
• scientific article; zbMATH DE number 3862440 (Why is no real title available?)
• Numeration and discrete dynamical systems
• On-line finite automata for addition in some numeration systems
• Iteration of rational transductions
• Foundations of online structure theory. II: The operator approach
• scientific article; zbMATH DE number 7168153 (Why is no real title available?)
• Computable classifications of continuous, transducer, and regular functions

This page was built for publication: Some characterizations of functions computable in on-line arithmetic

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