Talk:INTERCAL Turing-completeness proof

From Esolang
Jump to navigation Jump to search

Original (from Talk:INTERCAL)

(This was originally on the Talk:INTERCAL page, in the section Re: INTERCAL is Turing-complete.)

  • Should I alter the main article to reflect that INTERCAL is Turing-complete? (and also change the category, etc.)
  • Should I create a new page, INTERCAL Turing-completeness proof, and move the above program to it?
  • Should I add better documentation, and wikify the original documentation?

Alksentrs 22:29, 24 December 2007 (UTC)

Additional questions: Why is this called a "Boolf*** interpreter", when it's not Boolfuck (which has five instructions, like Smallfuck and F2)? Isn't it precisely the four-instruction language P prime prime adapted to right-infinite tape?--r.e.s. (Talk) 23:38, 24 December 2007 (UTC)
Fair point... I will now change this. Alksentrs 00:07, 25 December 2007 (UTC)
  • Note that this interpreter implements both left- and right-infinite P′′... If you say that .3 is data-right, .4 is data-left, < moves the pointer right and that +> toggles and moves left (extending if need be), then you end up with the original (left-infinite) P′′. Alksentrs 01:02, 25 December 2007 (UTC)

Original history

(Was originally on the Talk:INTERCAL page, just below the interpreter.)

Original:

Changes:

  • Fixed implementation limitation -- #0 is ignored like #3 and #4 when the loop handling code is scanning for matching brackets. Before, the RESUME command left #0 to #3 alone, and converted #4 to #3 (meaning that if it encountered a #0, it crashed). Now it also converts #0 to #3, therefore #0s are ignored when the condition has failed. Alksentrs 11:57, 24 December 2007 (UTC)
  • Fixed a bug -- replaced PLEASE FORGET #1 with PLEASE FORGET #2 just after line (19). This will prevent the NEXT stack overflowing (I think - it's quite hard to debug INTERCAL). Alksentrs 12:14, 24 December 2007 (UTC)
  • Tweaked the documentation (thrice). Alksentrs 02:07, 25 December 2007 (UTC)
  • Moved this history from main article to the talk page (it doesn't really belong there). Alksentrs 17:17, 22 January 2008 (UTC)
Retrieved from "https://esolangs.org/w/index.php?title=Talk:INTERCAL_Turing-completeness_proof&oldid=10847"