ScholarLens Back to search
2007•Journal of Jiangsu University of Science and TechnologyRequires access

Procedure Schemata Computable Functional Based on Relative Computability

Zaiyue Zhang

Open publisher page 0 citations

Abstract

The basic properties of the infinite computation are studied.The concept of the procedure schemata computable functional based on the relative computability theory is introduced.Compared with the computability of the partial recursive functional,the procedure schemata computable functional is proved to be an expansion of the partial recursive functional.This class of partial recursive functionals is a proper subclass of the procedure schemata computable functionals.

About this research paper

What this paper is about

The basic properties of the infinite computation are studied.The concept of the procedure schemata computable functional based on the relative computability theory is introduced.Compared with the computability of the partial recursive functional,the procedure schemata computable functional is proved to be an expansion of the partial recursive functional.This class of partial recursive functionals is a proper subclass of the procedure schemata computable functionals.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The basic properties of the infinite computation are studied.The concept of the procedure schemata computable functional based on the relative computability theory is introduced.Compared with the computability of the partial recursive functional,the procedure schemata computable functional is proved to be an expansion of the partial recursive functional.This class of partial recursive functionals is a proper subclass of the procedure schemata computable functionals.

Key concepts: Computability, Computable function, Computable analysis, Computable number, μ operator, Class (philosophy), Mathematics, Computation

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Procedure Schemata Computable Functional Based on Relative Computability — Research Paper | ScholarLens