On Computability of Computable Problems

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Khaliq, Asad
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913492264550400
author Khaliq, Asad
author_facet Khaliq, Asad
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2402_09410
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle On Computability of Computable Problems
Khaliq, Asad
Computational Complexity
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.
title On Computability of Computable Problems
topic Computational Complexity
url https://arxiv.org/abs/2402.09410