v50 Steam/Premium information for editors
  • v50 information can now be added to pages in the main namespace. v0.47 information can still be found in the DF2014 namespace. See here for more details on the new versioning policy.
  • Use this page to report any issues related to the migration.
This notice may be cached—the current version can be found here.

Editing 40d Talk:Computing

Jump to navigation Jump to search

Warning: You are not logged in.
Your IP address will be recorded in this page's edit history.

You are editing a page for an older version of Dwarf Fortress ("Main" is the current version, not "40d"). Please make sure you intend to do this. If you are here by mistake, see the current page instead.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.

Latest revision Your text
Line 161: Line 161:
 
:Starcraft is Turing complete - i'm guessing that makes DF so.  (Admittedly, one can program Tetris in Starcraft, and that seems hard in DF... no wait, i think i could make something that was logically equivalent, but it would *suck* to play it).  --[[User:Squirrelloid|Squirrelloid]] 22:24, 1 December 2009 (UTC)
 
:Starcraft is Turing complete - i'm guessing that makes DF so.  (Admittedly, one can program Tetris in Starcraft, and that seems hard in DF... no wait, i think i could make something that was logically equivalent, but it would *suck* to play it).  --[[User:Squirrelloid|Squirrelloid]] 22:24, 1 December 2009 (UTC)
 
:: I'd say it is turing complete, but it's hard to proof. (Btw, I like the tetris idea...) --[[User:Kami|Kami]] 09:05, 2 December 2009 (UTC)
 
:: I'd say it is turing complete, but it's hard to proof. (Btw, I like the tetris idea...) --[[User:Kami|Kami]] 09:05, 2 December 2009 (UTC)
:This Wikipedia article on the subject [http://en.wikipedia.org/wiki/Turing_completeness Turing Completeness] says that a machine must have the capability of conditional branching (if/goto) and the ability to write to memory. I believe that in the realm of Dwarf Fortress Computing a lot of serious work needs to be done in designing efficient, cheap, and reliable components before we can approach a Turing Machine. The Computing articles are still in the proof-of-concept stage as I read them and do not have much to say about building more complex assemblages of components with specific purposes. Some ingenious players have designed complex machines, but not documented them. A calculator does not a computer make, it must have the ability to logically branch based on programming.--[[User:Carlthuringer|Carlthuringer]] 10:07, 9 March 2010 (UTC)
 

Please note that all contributions to Dwarf Fortress Wiki are considered to be released under the GFDL & MIT (see Dwarf Fortress Wiki:Copyrights for details). If you do not want your writing to be edited mercilessly and redistributed at will, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource. Do not submit copyrighted work without permission!

Please sign comments with ~~~~

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel Editing help (opens in new window)

Template used on this page: