40d Talk:Computing - Revision history

Carlthuringer: /* This is either a very good or a very bad idea. */

2010-03-09T10:07:16Z

This is either a very good or a very bad idea.

71.194.101.232: /* Practical applications */

2010-03-09T02:37:52Z

Practical applications

71.194.101.232: /* Practical applications */

2010-03-09T02:37:11Z

Practical applications

71.194.101.232: /* Practical applications */

2010-03-09T02:34:57Z

Practical applications

QuietBot: moved Talk:Broken/40d\x3aComputing to 40d Talk:Computing: Fixing talk page name (135/738)

2010-03-08T21:43:21Z

moved Talk:Broken/40d\x3aComputing to 40d Talk:Computing: Fixing talk page name (135/738)

Briess: moved Talk:Computing to Talk:40d:Computing: 40d namespace migration

2010-03-08T01:53:20Z

moved Talk:Computing to [[Talk:40d:Computing]]: 40d namespace migration

Kami: NO base 8!

2009-12-02T09:28:12Z

NO base 8!

Kami: /* This is either a very good or a very bad idea. */

2009-12-02T09:05:38Z

This is either a very good or a very bad idea.

Squirrelloid: /* This is either a very good or a very bad idea. */

2009-12-01T22:24:50Z

This is either a very good or a very bad idea.

Frewfrux: /* Water Clock Questions */

2009-12-01T17:24:24Z

Water Clock Questions

← Older revision		Revision as of 10:07, 9 March 2010
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)

@@ Line 118: / Line 118: @@
   #####
 ---------------------------
-Two of the doors are connected to other parts of the machine; the third is is directly linked to the pressure plate in the middle so that it closes when the animal is in the center, and leads to outside.  When the entry door opens, the animal walks in seeking the exit, which closes before it get there.  The animal then has nowhere to go but out the next door, but only after that door is opened.
+Two of the doors are connected to other parts of the machine; the third is is directly linked to the pressure plate in the middle so that it closes when the animal is in the center, and leads to outside.  When the entry door opens, the animal walks in seeking the exit, which closes before it get there.  The animal then has nowhere to go but out the next door, but only after that door is opened. [[Special:Contributions/71.194.101.232|71.194.101.232]] 02:37, 9 March 2010 (UTC)
 == Base 8? ==

@@ Line 112: / Line 112: @@
 ::'''Animal Logic'''
 :::I think that a simpler method of one-way door could be used in an animal logic system:
- #<#
+---------------------------
-##D##
+  #<#
-+DPD+
+ ##D##
-#####
+ +DPD+
 Two of the doors are connected to other parts of the machine; the third is is directly linked to the pressure plate in the middle so that it closes when the animal is in the center, and leads to outside.  When the entry door opens, the animal walks in seeking the exit, which closes before it get there.  The animal then has nowhere to go but out the next door, but only after that door is opened.

@@ Line 109: / Line 109: @@
 ::[[Image:Onewaydoor.PNG]]
 ::Do tell me if you build it or need more details, optionally through #bay12games! --[[User:Zort|Zort]] 20:51, 12 May 2009 (UTC)
 == Base 8? ==

@@ Line 118: / Line 118: @@
 ::::[[Image:Prototypememory.PNG]]
 ::::Or do you mean a row of 8 pressure plates, each set to 1-1 (or some other level if I haven't thought about it enough)?  This row of plates I would personally consider to be binary, I suppose it doesn't matter.  Complexity is no obstacle for Dwarfputing. [[User:Zort|Zort]] 22:00, 12 May 2009 (UTC)
 == A practical use for borg logic ==

← Older revision		Revision as of 09:05, 2 December 2009
Line 149:		Line 149:

	: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)

← Older revision		Revision as of 22:24, 1 December 2009
Line 147:		Line 147:

	Is Dwarf Fortress Turing complete? If so, some very interesting ideas are in order.		Is Dwarf Fortress Turing complete? If so, some very interesting ideas are in order.
		+
		+	: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)

@@ Line 141: / Line 141: @@
 ::Also, I think I’ve figured out how to not have to worry about evaporation; make use of water pressure. If I build all the logic gates for my clock on a low enough level, and have them be filled from a multi-level cistern fairly high up, then the water pressure should cause the water to spread fast enough that evaporation won’t be an issue.  If it works the way I’m thinking it will, then there definitely is a way to build all these logic gates in a way that is dependable from a timing standpoint. --[[User:Frewfrux|Frewfrux]] 17:16, 1 December 2009 (UTC)
 == This is either a very good or a very bad idea. ==
 Is Dwarf Fortress Turing complete? If so, some very interesting ideas are in order.