Abstract
A graph G=(V, E) is recursive if every node of G has a finite number of neighbors, and both V and E are recursive (i.e., decidable). We examine the complexity of identifying the number of connected components of an infinite recursive graph, when no bound is given a priori. The Turing degree of the oracle required is already established in the literature. In this paper we analyze the number of queries required. We show that this problem is related to unbounded search in two ways: 1. If f is a non-decreasing recursive function, and ∑i≥02−f(i) ≤ 1 is effectively computable, then the number of components of a recursive graph G e , nC(G e ), can be found with f(nC(G e )) queries to o, and 2. If G is an infinite recursive graph and there is a set X such that nC(G) can be computed using f(nC(G)) queries to X, then f satisfies Kraft's inequality.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
