Links
- BLOGGER
- Home page
- edit this BLog
- ---------------
- CreatZy Notes
- CreatZy Physics Notes
- CreatZy Links
- ---------------
- Vietnamese Google
- Japanese Google
- Vdict
Site feeds
Archives
- April 2004
- May 2004
- October 2004
- November 2004
- December 2004
- January 2005
- May 2005
- June 2005
- August 2005
- October 2005
- November 2005
- November 2006
- January 2007
- April 2007
- July 2007
- November 2007
- December 2007
- January 2008
- October 2008
- June 2009
- October 2009
- November 2009
- June 2010
- January 2011
- February 2011
- May 2011
- September 2011
- November 2011
- December 2011
<<Home
Sunday, October 18, 2009 >>>>
The original Halting Problem: There exists a decider H(,) such that for all program p and input x, H(p,x) decides whether p halts on x.
The reduced Halting Problem: For all program p and input x, there exists a decider H(,) such that H(p,x) decides whether p halts on x.
Is the reduced problem decidable?
The reduced Halting Problem: For all program p and input x, there exists a decider H(,) such that H(p,x) decides whether p halts on x.
Is the reduced problem decidable?
↑top↑ ↑archives↑
There are/is 0 comment(s) on this post.
**Post a Comment**
<<Archive
<<Home
Previous posts:
- EXP(), The Limit of Our Mind!?!- Mutex & Sync, A note for myself
- Petri Nets, an Interesting Discovery
- Một chứng minh xây dựng tuyệt vời cho Bài toán Dừn...
- Lý thuyết của các Lý thuyết!
- The Implied Axioms of Science
- Simple Vs Complex
- Led or El-ee-dee? Star or Asterisk?
- "Cái USB" ?!
- Số Lớn...
