z-logo
Premium
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
Author(s) -
Martin Donald A.
Publication year - 1966
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19660120125
Subject(s) - recursively enumerable language , citation , computer science , foundation (evidence) , recursively enumerable set , information retrieval , mathematical economics , library science , algorithm , mathematics , law , political science

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom