Add to ORKGA detailed study of computable iterations of Gödel-sentences, both in normal recursion and generalisations to other recursive theories
The halting set Kr = (x I r converges}, forany G6del numbering ~ = {~0, ~1,-..}, is nonrecursive. It...
The theory of analog computation aims at modeling computational systems that evolve in a continuous ...
AbstractWe present a derivation of Gosper's algorithm which permits generalization to higher-order r...
We describe various computational models based initially, but not exclusively, on that of the Turing...
Contains fulltext : 199717pub.pdf (publisher's version ) (Open Access) ...
Abstract. A computer implementation of Gödel’s algorithm for class formation in Mathematica TM was u...
Let T be Gödel's system of primitive recursive functionals of finite type in the lambda formulation....
AbstractThis paper is a contribution to the development of a theory of behaviour of programs. We stu...
The SAGE Encyclopedia of Human Communication Sciences and DisordersRecursion is a mathematical princ...
Current explanation-based generalization (EBG) tech-niques can perform badly when the problem being ...
This book is a development of class notes for a two-hour lecture including a two-hour lab held for s...
We generalize standard Turing machines working in time ω on a tape of length ω to abstract machines ...
In the realm of functional programming a wealth of techniques have been explored to transform a prog...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-so...
The halting set Kr = (x I r converges}, forany G6del numbering ~ = {~0, ~1,-..}, is nonrecursive. It...
The theory of analog computation aims at modeling computational systems that evolve in a continuous ...
AbstractWe present a derivation of Gosper's algorithm which permits generalization to higher-order r...
We describe various computational models based initially, but not exclusively, on that of the Turing...
Contains fulltext : 199717pub.pdf (publisher's version ) (Open Access) ...
Abstract. A computer implementation of Gödel’s algorithm for class formation in Mathematica TM was u...
Let T be Gödel's system of primitive recursive functionals of finite type in the lambda formulation....
AbstractThis paper is a contribution to the development of a theory of behaviour of programs. We stu...
The SAGE Encyclopedia of Human Communication Sciences and DisordersRecursion is a mathematical princ...
Current explanation-based generalization (EBG) tech-niques can perform badly when the problem being ...
This book is a development of class notes for a two-hour lecture including a two-hour lab held for s...
We generalize standard Turing machines working in time ω on a tape of length ω to abstract machines ...
In the realm of functional programming a wealth of techniques have been explored to transform a prog...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-so...
The halting set Kr = (x I r converges}, forany G6del numbering ~ = {~0, ~1,-..}, is nonrecursive. It...
The theory of analog computation aims at modeling computational systems that evolve in a continuous ...
AbstractWe present a derivation of Gosper's algorithm which permits generalization to higher-order r...