Small Universal Devices

Alhazov, Artiom; Rogozhin, Yurii; Verlan, Sergey

doi:10.1007/978-3-319-13350-8_19

Cited by 1 publication

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, from a theoretical point of view, considering such halting conditions could lead to novel characterizations of a series of complexity classes (like the ones discussed in this paper) by means of nature-inspired computational models, as they seem quite close to the idea of deciding with respect to the shortest computations. To this end, we refer to the papers [11,12], and we leave open the question of whether similar results could be obtained for bio-inspired machines with more particular and compact structure [13][14][15] or for bio-inspired problem solvers [16].…”

Section: Introductionmentioning

confidence: 90%

On Turing Machines Deciding According to the Shortest Computations

Manea

2021

Axioms

View full text Add to dashboard Cite

In this paper we propose and analyse from the computational complexity point of view several new variants of nondeterministic Turing machines. In the first such variant, a machine accepts a given input word if and only if one of its shortest possible computations on that word is accepting; on the other hand, the machine rejects the input word when all the shortest computations performed by the machine on that word are rejecting. We are able to show that the class of languages decided in polynomial time by such machines is PNP[log]. When we consider machines that decide a word according to the decision taken by the lexicographically first shortest computation, we obtain a new characterization of PNP. A series of other ways of deciding a language with respect to the shortest computations of a Turing machine are also discussed.

show abstract

Section: Introductionmentioning

confidence: 90%

On Turing Machines Deciding According to the Shortest Computations

Manea

2021

Axioms

View full text Add to dashboard Cite

show abstract

Small Universal Devices

Cited by 1 publication

References 30 publications

On Turing Machines Deciding According to the Shortest Computations

On Turing Machines Deciding According to the Shortest Computations

Contact Info

Product

Resources

About