On Computability of Computable Problems (2402.09410v3)

Abstract: Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can execute any algorithm therefore every computable problem is Turing computable. Cardinality of Turing machines and computable problems is equal-both are countably infinite. In this paper we introduce new type of problems by constructing a transform technique and applying it on some computable problems. The transformed problems can be computable of uncomputable.