Reductional programming of functions represented by recurrent relations of the first order

MaRDI QIDQ2760564zbMATH OpenFDO

Authors O. I. Manakova

Publication date 12 December 2001

Published in Visnyk. Seriya: Fizyko-Matematychni Nauky. Kyïvs'kyĭ Universytet Imeni Tarasa Shevchenka (Search for Journal in Brave)

zbMATH Keywords

programming of functionsrecurrent relations

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Reduction programming of recurrent sequences
• Recursive Programs as Definitions in First-Order Logic
• First-order reduction and computational complexity
• Program algebras of recursive functions
• scientific article; zbMATH DE number 3864470
• scientific article; zbMATH DE number 4210120
• On reducibility of partial recursive functions
• scientific article; zbMATH DE number 1456960
• Reduction techniques for first-order reasoning
• Program-closed classes of general recursive functions and predicates of finite rank

Cited in

(7)

• scientific article; zbMATH DE number 3911681 (Why is no real title available?)
• scientific article; zbMATH DE number 3928187 (Why is no real title available?)
• Design of recursive programs for calculating periodically defined functions over finitely defined data structures
• scientific article; zbMATH DE number 29625 (Why is no real title available?)
• scientific article; zbMATH DE number 1203327 (Why is no real title available?)
• scientific article; zbMATH DE number 890353 (Why is no real title available?)
• Correctness of the formal generalized net project of the connections between procedural program functions

This page was built for publication: Reductional programming of functions represented by recurrent relations of the first order

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