Simulation of simultaneous safe recursion over an arbitrary structure

DOI10.1016/J.IPL.2006.03.003MaRDI QIDQ845681zbMATH OpenOpenAlexFDO

Authors Olga Xirotiri

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2006.03.003

zbMATH Keywords

computational complexitytheory of computationsafe recursionBSS-machinesprojective Turing machines

Mathematics Subject Classification ID

Recommendations

• There is no safe pairing function over an arbitrary structure
• Safe recursive set functions
• Safe recursion over an arbitrary structure: PAR, PH and DPH
• scientific article; zbMATH DE number 1114331
• Fixpoint semantics and simulation

Cites work

• scientific article; zbMATH DE number 1956513 (Why is no real title available?)
• A new recursion-theoretic characterization of the polytime functions
• Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

This page was built for publication: Simulation of simultaneous safe recursion over an arbitrary structure

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