On computable tree functions

DOI10.1007/3-540-44464-5_20MaRDI QIDQ2766544zbMATH OpenFDO

Authors Masahiro Kimoto, Masako Takahashi

Publication date 28 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44464-5_20

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• On functions computed on trees
• scientific article; zbMATH DE number 109220
• Computability in uncountable binary trees
• Self-embeddings of computable trees
• Computing on a free tree via complexity-preserving mappings
• scientific article; zbMATH DE number 3854413
• A complexity calculus for recursive tree algorithms
• A lower bound on the growth of functions computed by tree transductions
• Foundations of Information and Knowledge Systems
• On the computational complexity of the theory of complete binary trees

Cited in

(11)

• scientific article; zbMATH DE number 416857 (Why is no real title available?)
• A hierarchy of loop programs over binary trees
• scientific article; zbMATH DE number 109220 (Why is no real title available?)
• scientific article; zbMATH DE number 2162203 (Why is no real title available?)
• scientific article; zbMATH DE number 1379304 (Why is no real title available?)
• scientific article; zbMATH DE number 919846 (Why is no real title available?)
• A lower bound on the growth of functions computed by tree transductions
• The tree of tuples of a structure
• On functions computed on trees
• scientific article; zbMATH DE number 5200724 (Why is no real title available?)
• Computable trees of Scott rank ω₁^CK, and computable approximation

This page was built for publication: On computable tree functions

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