Talk:Befunge

message: The article claimed that Befunge is "unlike most machine languages, not Turing-complete."
"Machine languages" describes languages that describe the operation of actual machines -- this class of language is never Turing complete. Machines have actual limits on the amount of addressable storage and on the word size, much like Befunge, so there are only a finite number of states they can enter.
Only abstract languages can be Turing complete in a strict sense. Such as the class of Turing machines themselves, or lambda calculus. Languages whose specification include no bounds on storage can be Turing complete in the abstract (but their implementations on actual machines are not.)
— Preceding unsigned comment added by 24.16.144.120 (talk) 13:31, 8 September 2013 (UTC)
thread_title:  Turing completeness 

message: For this to work as expected you need a compliant interpreter that "returns" 0 when you try to pop an empty stack.
Wouldn't it make more sense and be simpler to just push zero onto the stack at the very beginning of the program? Gereeter (talk) 00:27, 20 November 2010 (UTC)
thread_title:  Complex Hello World Example 

message: Not a lot of activity here, but I felt it needed a few changes. However, I was a bit conservative, so I'll post a few ideas here. 
1). I can't find a link to Betty anywhere, but instead of deleting it entirely, I just put   around it for now (which points to an empty page for good reason). If someone knows more about it, feel free to add to it. Otherwise, it's pretty pointless to mention without a link. 
2). I added like two links and moved the BFC link from the middle of the article itself down to the bottom with the others. However, I can already tell it's getting big, and I know some strict admins will say, "Wikipedia is not a links directory!" And yet I feel it's more useful with more links than less (and I could still add more!). But whatever. 
3). I also wonder if some mention should be made of the various test suites available (Deewiant's Mycology, Jeffrey Lee's Fungus). 
4). In reality, while more exist than just Befunge93 and Funge98, it seems those are the most popular ones. Maybe the article should be split off (or expanded) into two separate ones in the future. -- Armslurp (talk) 20:54, 4 November 2009 (UTC)
thread_title:  Latest Changes 

message: Does someone want to add the following?
http://yabi93.sf.net
:I agree. Added.--Dougall 11:18, 24 June 2006 (UTC)
thread_title:  New Interpreter 

message: An anonymous user changed the word 'like' to 'unlike' here:
 Since a Befunge-93 program can only have a single stack and its storage array is bounded, the Befunge-93 language 
 is, unlike most machine languages, not Turing-complete. 
I don't remember which statement should be true.  My gut feeling was that most machine languages are, due to address space limitations, not turing-complete, but close enough for practical purposes. Anyone CS experts care to resolve this? --Stevage 22:55, 1 December 2005 (UTC)
thread_title:  Malicious edit? 

message: Perhaps some explanation of the example would be useful?  I suppose I didnt look too hard at it, but I needed someone to explain that 32 was ascii for space, and 10 was ascii for newline.
:Done.
:Stelio 00:19, 3 March 2006 (UTC)
thread_title:  Hello World example 

message: ...then we should be using a table, right? Guess full-fledged tables are too hard to manage (one TD for each char!) so I added monospaced fonts for now. —Preceding unsigned comment added by Jafet.vixle (talk • contribs) 09:58, 9 May 2006 (UTC)
replies: text: Excuse me, but what are you talking about? --ZeroOne 10:45, 9 May 2006 (UTC)

text: There are two code examples and in both of them the characters do align correctly. Besides, I don't see any edits in the main article made by you, so where exactly did you add monospaced fonts for now? Oh, and please sign your posts using four tildes: ~~~~. That expands automatically to your user name and current time/date. :) --ZeroOne 13:27, 9 May 2006 (UTC)
thread_title:  2D array? 

message: I think that a distinction should be made between Befunge-93 and Befunge-98. The section title "Instruction List" is an excellent list of Befunge-93 instructions, however, Befunge-98 has many more, including '[' (turn left), ']' (turn right), 'r' (reflect) and 'n' (clear stack). I think that there should either be a definative list (like the one found ), a line should be added stating that this is a list of Befunge-93 commands or the title should be changed to "Befunge-93 instruction list".--Dougall 11:11, 24 June 2006 (UTC)
replies: text: I did it myself (but forgot to use the edit discription thing). If anyone has any objections, feel free to tell me.--Dougall 07:56, 28 June 2006 (UTC)
replies: text: It seems to me that the most recent version of the language should be the one most thoroughly described.  So why don't we replace the B-93 instruction list with one for B-98?  I'll do it if no one has any objections. Stebbins 20:53, 4 December 2006 (UTC)
replies: text: I think that would be good, as long as it says what instructions can only be used in 98, and which can be used in both.12Me21 (talk) 03:20, 18 April 2015 (UTC)
thread_title:  Befunge-93 vs. Befunge-98 

message: :"In this model, the grid behaves like a torus of finite size with respect to wrapping, while still allowing itself to be extended indefinitely."
This doesn't seem to be an accurate description at all.  In Funge-98, the PC can move diagonally.  Then when it disappears off to infinity and wraps round, it always remains on the same line.  This would not be generally true on a torus.
Really, Lahey space is an extension of Euclidean space, in which the 'ends' of a line are joined at infinity.  I'm not sure if it can reasonably be compared to projective space.  Can anyone come up with a better description? -- Smjg 18:46, 19 September 2007 (UTC)
thread_title:  Lahey space vs. torus 

message: Does anyone know the etymology of the name "Befunge"? wr 87.139.81.19 (talk) 11:19, 10 April 2008 (UTC)
thread_title:  What does the name mean? 

message: Yeah.  The description there is totally wrong.  When I came up with Lahey-space, I was inspired by the Riemann sphere.  Every line is joined by the infinite point to the other end of the same line.  And that when you return to the beginning, you'll be at the same point.
When the PC is travelling with any velocity that isn't 1 in a cardinal direction, after executing the last instruction before going to infinity, it finds the last instruction in the other direction and starts executing from there.
Because of the inspiration from the Riemann sphere, I actually wanted to have the ability to define the instruction at the infinite point, but I couldn't think of any interesting uses, so I don't know if I even ever suggested it.
I suppose that you could say it acts like a torus when the PC is traveling at normal velocities ((0,1), (0, -1), (1,0), (-1,0),) but when the X instruction is used, it has a standard behavior, no matter the size of the grid.  If you used a torus, then the size of the grid would affect the behavior.
I'm not sure whether I'm comfortable editing this page as I'm referenced.  Is it acceptable for me to change the description of the math?
clahey (talk) 17:41, 3 December 2009 (UTC)
thread_title:  Lahey-space 

message: It doesn't say what to do in the case of potential errors. For example, what if a negative number is passed to , ?
should it print; nothing, the absolute value, 128-#, give an error???
12Me21 (talk) 12:29, 24 April 2015 (UTC)
thread_title:  Errors? 

message: As explained in the content policies, Wikipedia is not a means of promotion and not a repository of links. There is absolutely no need for this article to include links to every Befunge interpreter or Befunge related website on the internet, which seems to be the direction it's going. My recommendation would to get rid of everything in the External Links section except for official links to the two main specifications, and the reference Befunge interpreter.
I'd also recommend cleaning up the Compilation section which looks like it has become a magnet for self promotion too. I'd be OK with leaving the section on bef2c given that it's part of the official distribution, and the Betty compiler is arguably notable as the first compiler (?), but I think the rest should definitely go.
Unless anyone has any objections, I'll be making these changes in the next week or so. If you think there is a reason why a particular link should be kept, please provide some justification for why you think it is notable and adds value to the article (and not just another Befunge interpreter/compiler/webpage).
--j4_james (talk) 17:25, 18 August 2016 (UTC)
thread_title:  Link Spam 

message: Hello fellow Wikipedians,
I have just modified  on Befunge. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
*Added archive https://web.archive.org/web/20160105200447/http://jargon-file.org/archive/jargon-4.4.7.dos.txt to http://jargon-file.org/archive/jargon-4.4.7.dos.txt
When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at ).
Cheers.—InternetArchiveBot (Report bug) 21:37, 29 October 2016 (UTC)
replies: text: I reviewed your edit, and the Jargon File link that you marked as dead was working fine for me (I checked on multiple occasions). I have therefore reverted that change. --j4_james (talk) 14:20, 1 November 2016 (UTC)
thread_title:  External links modified 

message: Hello fellow Wikipedians,
I have just modified one external link on Befunge. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
*Added archive https://web.archive.org/web/20160105200447/http://jargon-file.org/archive/jargon-4.4.7.dos.txt to http://jargon-file.org/archive/jargon-4.4.7.dos.txt
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
Cheers.—InternetArchiveBot (Report bug) 03:00, 17 July 2017 (UTC)
thread_title:  External links modified 

message: :Removed 2012 "External links" tag: When the article was tagged for external links issues there was something like 17 links. This has been trimmed to three so it seems the tags was just not removed. Otr500 (talk) 01:38, 19 February 2020 (UTC)
thread_title:  External links tag