##存在一个多项式时间图灵机,它对于任何输入''w''以 ''f''(''w'') 停机。【不清楚如何翻译解释f(w),在[[wikipedia:P_versus_NP_problem#NP-completeness_2|链接]]中原句为there exists a polynomial-time Turing machine that halts with ''f''(''w'') on its tape on any input ''w''.】 | ##存在一个多项式时间图灵机,它对于任何输入''w''以 ''f''(''w'') 停机。【不清楚如何翻译解释f(w),在[[wikipedia:P_versus_NP_problem#NP-completeness_2|链接]]中原句为there exists a polynomial-time Turing machine that halts with ''f''(''w'') on its tape on any input ''w''.】 |