Filters








6,476 Hits in 10.2 sec

On the Density of Languages Accepted by Turing Machines and Other Machine Models [article]

Oscar H. Ibarra, Ian McQuillan
2019 pre-print
Here, it is shown that it is decidable whether the language accepted by a nondeterministic Turing machine with a one-way read-only input and a reversal-bounded read/write worktape (the read/write head  ...  A language is dense if the set of all infixes (or subwords) of the language is the set of all words.  ...  This inspired the authors to investigate the store language of other machine models, especially some types of Turing machines [12] .  ... 
doi:10.25596/jalc-2018-189 arXiv:1903.03018v1 fatcat:nlr5gohe35cvtnj73sc2fwv5fa

P versus NP

Frank Vega
2020 Zenodo  
However, a precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed.  ...  $P$ versus $NP$ is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is $P$ equal to $NP$?  ...  Near perfect vision recognition, language comprehension and translation and all other learning tasks become trivial [12] .  ... 
doi:10.5281/zenodo.4031915 fatcat:d5577o6m3nf6tmeeu2pjy4a3u4

P versus NP

Frank Vega
2020 Zenodo  
However, a precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed.  ...  $P$ versus $NP$ is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is $P$ equal to $NP$?  ...  In other words, this means the language L(M ) can be decided by the Turing machine M in polynomial time.  ... 
doi:10.5281/zenodo.4032664 fatcat:v4i34of225fyrhdj3jba3sfvrq

P versus NP

Frank Vega
2020 Zenodo  
However, a precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed.  ...  $P$ versus $NP$ is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is $P$ equal to $NP$?  ...  In other words, this means the language L(M ) can be decided by the Turing machine M in polynomial time.  ... 
doi:10.5281/zenodo.4032885 fatcat:fcwtyjxnejhrtn4wigkjkzlhca

P versus NP

Frank Vega
2020 Zenodo  
However, a precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed.  ...  $P$ versus $NP$ is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is $P$ equal to $NP$?  ...  Near perfect vision recognition, language comprehension and translation and all other learning tasks become trivial [12] .  ... 
doi:10.5281/zenodo.4031951 fatcat:4itwspl4ujezhlrucw6peae5du

P versus NP

Frank Vega
2020 Zenodo  
However, a precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed.  ...  $P$ versus $NP$ is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is $P$ equal to $NP$?  ...  In other words, this means the language L(M ) can be decided by the Turing machine M in polynomial time.  ... 
doi:10.5281/zenodo.4031969 fatcat:yyq63zwpfva75auvpv5lnse2bu

P versus NP

Frank Vega
2020 Zenodo  
It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution.  ...  However, a precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed.  ...  In other words, this means the language L(M ) can be decided by the Turing machine M in polynomial time.  ... 
doi:10.5281/zenodo.3951364 fatcat:nemlr46tvrfmbjqbtbf3qkxufe

P versus NP

Frank Vega
2020 Zenodo  
However, a precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed.  ...  $P$ versus $NP$ is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is $P$ equal to $NP$?  ...  In other words, this means the language L(M ) can be decided by the Turing machine M in polynomial time.  ... 
doi:10.5281/zenodo.4033156 fatcat:5fzo2dlhwrhnrhcy6nom5ugozq

P versus NP

Frank Vega
2020 Zenodo  
However, a precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed.  ...  $P$ versus $NP$ is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is $P$ equal to $NP$?  ...  In other words, this means the language L(M ) can be decided by the Turing machine M in polynomial time.  ... 
doi:10.5281/zenodo.4033107 fatcat:ze74wf4pnbfefoa4fz7l4botiq

P versus NP

Frank Vega
2020 Zenodo  
However, a precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed.  ...  $P$ versus $NP$ is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is $P$ equal to $NP$?  ...  In other words, this means the language L(M ) can be decided by the Turing machine M in polynomial time.  ... 
doi:10.5281/zenodo.4033042 fatcat:2yh5qflfrbdeflxl7ccukjd4am

P versus NP

Frank Vega
2020 Zenodo  
It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution.  ...  However, a precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed.  ...  In other words, this means the language L(M ) can be decided by the Turing machine M in polynomial time.  ... 
doi:10.5281/zenodo.3951179 fatcat:ifzisiklazebbmanrr6usekob4

P versus NP

Frank Vega
2020 Zenodo  
However, a precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed.  ...  $P$ versus $NP$ is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is $P$ equal to $NP$?  ...  In other words, this means the language L(M ) can be decided by the Turing machine M in polynomial time.  ... 
doi:10.5281/zenodo.4033167 fatcat:kqxydhkzgjaddorm3cvls3jyfy

P versus NP

Frank Vega
2020 Zenodo  
It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution.  ...  However, a precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed.  ...  In other words, this means the language L(M ) can be decided by the Turing machine M in polynomial time.  ... 
doi:10.5281/zenodo.3950942 fatcat:qi5m7xgiuvem3epbq7xpvz6ztu

P versus NP

Frank Vega
2020 Zenodo  
It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution.  ...  However, a precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed.  ...  In other words, this means the language L(M ) can be decided by the Turing machine M in polynomial time.  ... 
doi:10.5281/zenodo.3950870 fatcat:5xp5iedq4fa2jnvi6rkcy6ltci

P versus NP

Frank Vega
2020 Zenodo  
It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution.  ...  However, a precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed.  ...  In other words, this means the language L(M ) can be decided by the Turing machine M in polynomial time.  ... 
doi:10.5281/zenodo.3951064 fatcat:7p4x3llv6rhuzelbcvdavzz7ti
« Previous Showing results 1 — 15 out of 6,476 results