Report sets new method of defining computable functions. This is formalization of traditional function descriptions, so it allows to define functions in very intuitive way. Discovery of Ackermann function proved that not all functions that can be easily computed can be so easily described with Hilbert’s system of recursive functions. Normal functions lack this disadvantage
We consider two applications of recursive functionals. The first application concerns Gödel’s theory...
In the last decade, the field of analog computation has experienced renewed interest. In particular,...
Abstract. More than beingjust a tool for expressingalgorithms, a welldesigned programming language a...
© 2018 Association for Computing Machinery. Recursive programs can now be expressed as normal forms ...
For knowing that a function f: Nk → N is computable one does not need a definition of what is comput...
AbstractThe functions of Computable Analysis are defined by enhancing the capacities of normal Turin...
This thesis focuses on machine-free definition of polynomial functions. The main goal is to not only...
Mathematical LogicThe Ackermann function is a classic example of a function that is not "primitive r...
Broad in coverage, mathematically sophisticated, and up to date, this book provides an introduction ...
AbstractThe first example of an absolutely normal number was given by Sierpinski in 1916, twenty yea...
The theory of computability, or basic recursive function theory as it is often called, is usually m...
We propose a detailed proof of the fact that the inverse of Ackermannfunction is computable in linea...
AbstractThe functions of computable analysis are defined by enhancing normal Turing machines to deal...
AbstractThe theory of computability, or basic recursive function theory as it is often called, is us...
Recently, using a limit schema, we presented an analog and machine independent algebraic characteriz...
We consider two applications of recursive functionals. The first application concerns Gödel’s theory...
In the last decade, the field of analog computation has experienced renewed interest. In particular,...
Abstract. More than beingjust a tool for expressingalgorithms, a welldesigned programming language a...
© 2018 Association for Computing Machinery. Recursive programs can now be expressed as normal forms ...
For knowing that a function f: Nk → N is computable one does not need a definition of what is comput...
AbstractThe functions of Computable Analysis are defined by enhancing the capacities of normal Turin...
This thesis focuses on machine-free definition of polynomial functions. The main goal is to not only...
Mathematical LogicThe Ackermann function is a classic example of a function that is not "primitive r...
Broad in coverage, mathematically sophisticated, and up to date, this book provides an introduction ...
AbstractThe first example of an absolutely normal number was given by Sierpinski in 1916, twenty yea...
The theory of computability, or basic recursive function theory as it is often called, is usually m...
We propose a detailed proof of the fact that the inverse of Ackermannfunction is computable in linea...
AbstractThe functions of computable analysis are defined by enhancing normal Turing machines to deal...
AbstractThe theory of computability, or basic recursive function theory as it is often called, is us...
Recently, using a limit schema, we presented an analog and machine independent algebraic characteriz...
We consider two applications of recursive functionals. The first application concerns Gödel’s theory...
In the last decade, the field of analog computation has experienced renewed interest. In particular,...
Abstract. More than beingjust a tool for expressingalgorithms, a welldesigned programming language a...
DOI
Add to ORKG