Zobrazeno 1 - 10
of 594
pro vyhledávání: '"halting problem"'
Autor:
Viktor Chernov, Vladimir Chernov
Publikováno v:
Axioms, Vol 13, Iss 5, p 293 (2024)
We study the properties of the constructive linear programming problems. The parameters of linear functions in such problems are constructive real numbers. Solving such a problem involves finding the optimal plan with the constructive real number com
Externí odkaz:
https://doaj.org/article/f8fcac8f8048465bbb9da86503a59cb5
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Jaroslav Peregrin
Publikováno v:
Acta Universitatis Carolinae: Philosophica et Historica, Vol 2017, Iss 2, Pp 33-43 (2017)
It is a trivial fact that if we have a square table filled with numbers, we can always form a column which is not yet contained in the table. Despite its apparent triviality, this fact can lead us the most of the path-breaking results of logic in the
Externí odkaz:
https://doaj.org/article/5d411737640d45b2aed099c9e1f18a4b
Autor:
Peregrin, Jaroslav
Publikováno v:
Acta Universitatis Carolinae Philosophica et Historica. XXIII(2):33-43
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=592198
Autor:
Rodrigo Torres-Avilés
Publikováno v:
Journal of Computer and System Sciences. 121:49-56
In 2014, Jeandel proved that two dynamical properties regarding Turing machines can be computable with any desired error ϵ > 0 , the Turing machine Maximum Speed and Topological Entropy. Both problems were proved in parallel, using equivalent proper
Autor:
Jihyeon Yoon
P vs NP problem turns out to be P=NP in quantum computing but remains questions of optimization in classical computing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b98fd37175819938245e8709bfdeba9
https://doi.org/10.36227/techrxiv.20449572.v3
https://doi.org/10.36227/techrxiv.20449572.v3
Publikováno v:
Communications of the ACM. 64:131-138
Note from the Research Highlights Co-Chairs: A Research Highlights paper appearing in Communications is usually peer-reviewed prior to publication. The following paper is unusual in that it is still under review. However, the result has generated eno
Autor:
Jihyeon Yoon
P-NP problem turns out to be undecidable in an extended context of Continuum Hypothesis and Halting Problem.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82e5360e95272d30fdb2c0a53bb9c600
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.