Zobrazeno 1 - 10
of 735
pro vyhledávání: '"Non-deterministic Turing machine"'
Autor:
Edward E. Ogheneovo
Publikováno v:
International Journal of Advanced Engineering Research and Science. 7:206-213
Stephen Cook and Leonard Levin independently proved that there are problems called NonPolynomial-complete (NP-complete) problems. The theorem is today referred to as Cook-Levin theorem. The theorem states that Boolean satisfiability problem is NP-com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d288307e7a991fb1765e208742321006
https://doi.org/10.22161/ijaers.73.34
https://doi.org/10.22161/ijaers.73.34
Publikováno v:
Acta Informatica. 58:95-152
Compositions of tree-walking tree transducers form a hierarchy with respect to the number of transducers in the composition. As main technical result it is proved that any such composition can be realized as a linear-bounded composition, which means
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::40bc75699bd33949c5c412fd20b11ad3
https://doi.org/10.1007/s00236-019-00360-8
https://doi.org/10.1007/s00236-019-00360-8
Autor:
Alexander A. Rubtsov
Publikováno v:
Developments in Language Theory ISBN: 9783030815073
DLT
DLT
A d-limited automaton is a nondeterministic Turing machine that uses only the cells with the input word (and end-markers) and rewrites symbols only in the first d visits. This model was introduced by T. Hibbard in 1967 and he showed that d-limited au
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3565cf7500648eea89d1e1f29bf845b2
https://doi.org/10.1007/978-3-030-81508-0_28
https://doi.org/10.1007/978-3-030-81508-0_28
Autor:
Kristina Šekrst
Publikováno v:
Guide to Deep Learning Basics ISBN: 9783030375904
Computational complexity is a discipline of computer science and mathematics which classifies computational problems depending on their inherent difficulty, i.e. categorizes algorithms according to their performance, and relates these classes to each
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78a524d3b6f6bd5add9be88a28fdb902
https://doi.org/10.1007/978-3-030-37591-1_11
https://doi.org/10.1007/978-3-030-37591-1_11
Publikováno v:
Proceedings of ACMC'2018
Proceedings of ACMC'2018, 2018, Auckland, New Zealand. pp.213--221
Proceedings of ACMC'2018, 2018, Auckland, New Zealand. pp.213--221
It is well known that the kind of P systems involved in the definition of the P conjecture is able to solve problems in the complexity class $\mathbf{P}$ by leveraging the uniformity condition. Here we show that these systems are indeed able to simul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db8e308862cd3aceba8b796c24bb4200
http://hdl.handle.net/10281/276860
http://hdl.handle.net/10281/276860
Autor:
Keisuke Nakano
Publikováno v:
Science of Computer Programming. 215:102748
A reversible Turing machine is a forward and backward deterministic Turing machine, which has been an expressive model of reversible computation. It is obvious that every reversible Turing machine computes an injective function under a function seman
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba9829f50d8299b6405bcba63ecf6f13
https://doi.org/10.1016/j.scico.2021.102748
https://doi.org/10.1016/j.scico.2021.102748
Publikováno v:
Natural Computing. 17:799-809
In this paper, we consider the computational power of a new variant of networks of splicing processors in which each processor as well as the data navigating throughout the network are now considered to be polarized. While the polarization of every p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6299d33416127355cbda16ef318f506f
https://doi.org/10.1007/s11047-018-9691-0
https://doi.org/10.1007/s11047-018-9691-0
Autor:
Giangiacomo Gerla
Publikováno v:
Fuzzy Sets and Systems. 333:87-105
A normal form for fuzzy Turing machines is proposed and examined. This normal form is arithmetical in nature since the truth values are substituted by n-ples of natural numbers and the operation interpreting the conjunction becomes a sort of truncate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1370a7d01e11ad2e37b8de75744f9bd
https://doi.org/10.1016/j.fss.2017.01.008
https://doi.org/10.1016/j.fss.2017.01.008
Autor:
Nestor Diaz
Publikováno v:
Complex Systems. 26:283-294
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b69f36c71ee1469d7b81bb5b9ddb0b1
https://doi.org/10.25088/complexsystems.26.3.283
https://doi.org/10.25088/complexsystems.26.3.283
Autor:
Leo Corry
Publikováno v:
Communications of the ACM. 60:50-58
Turing's machines of 1936 were a purely mathematical notion, not an exploration of possible blueprints for physical calculators.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::980f62e293f667d421b1abe0ce5d454b
https://doi.org/10.1145/3104032
https://doi.org/10.1145/3104032