COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF

Publisher： Cambridge University Press

E-ISSN： 1943-5886|80|4|1211-1235

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.80, Iss.4, 2015-12, pp. : 1211-1235

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Can there be no nonrecursive functions?

By  

The Journal of Symbolic Logic, Vol. 36, Iss. 2, 1971-06 ,pp. : 309-315

Cambridge University Press

Access to resources Recommend Favorite

Nonrecursive combinatorial functions

By  

The Journal of Symbolic Logic, Vol. 37, Iss. 1, 1972-03 ,pp. : 90-95

Cambridge University Press

Access to resources Recommend Favorite

Diagonally Non-Computable Functions and Bi-Immunity

By  

The Journal of Symbolic Logic, Vol. 78, Iss. 3, 2013-09 ,pp. : 977-988

Cambridge University Press

Access to resources Recommend Favorite

Comparing the Likelihood Functions of Phylogenetic Trees

By Bar-Hen A.  

Annals of the Institute of Statistical Mathematics, Vol. 52, Iss. 1, 2000-03 ,pp. : 43-56

Springer Publishing Company

Access to resources Recommend Favorite

Nonrecursive tilings of the plane. I

By  

The Journal of Symbolic Logic, Vol. 39, Iss. 2, 1974-06 ,pp. : 283-285

Cambridge University Press

Access to resources Recommend Favorite