MTG thread

  • Guest, it's time once again for the massively important and exciting FoH Asshat Tournament!



    Go here and give us your nominations!
    Who's been the biggest Asshat in the last year? Give us your worst ones!
Harshaw

Harshaw

Throbbing Member
24,350
123,992
Hmm interesting especially with a Blood Sun maybe?
212223
 
  • 3Like
Reactions: 2 users
Kuro

Kuro

Naxxramas 1.0 Raider
8,936
23,490
If you Reanimate that demon, you draw 8 cards immediatly.
 
  • 2Like
Reactions: 1 users
pharmakos

pharmakos

soʞɐɯɹɐɥd
<Bronze Donator>
16,305
-2,234
Ajani gives flying in his ultimate? Fits white yeah but doesn't fit Ajani. Flavor fail.
 
Mahes

Mahes

Bronze Baronet of the Realm
5,245
6,262
pharmakos said:
Ajani gives flying in his ultimate? Fits white yeah but doesn't fit Ajani. Flavor fail.
Click to expand...

I also would argue that for the trouble of getting to that point, you would think it might be an emblem and not just a one time thing. I like Mu Yangling.
 
  • 1Like
Reactions: 1 user
pharmakos

pharmakos

soʞɐɯɹɐɥd
<Bronze Donator>
16,305
-2,234
Mahes said:
I also would argue that for the trouble of getting to that point, you would think it might be an emblem and not just a one time thing. I like Mu Yangling.
Click to expand...

Yeah those must be the planeswalkers from the PW decks, they never make those as strong as regular 6-mana walkers.
 
  • 1Like
Reactions: 1 user
MusicForFish

MusicForFish

Ultra Maga Instinct
<Prior Amod>
34,222
134,364
Interesting read.
It’s possible to build a Turing machine within Magic: The Gathering
Churchill proposed the possibility of assembling a universal Turing machine from Magic cards several years ago as a means of proving that the game is "Turing complete." (You can read all the gory details at his website.) This latest work is a culmination of those earlier findings.

First proposed by Alan Turing in the 1930s, a Turing machine is an abstract concept, as opposed to a physical object, that laid the conceptual groundwork for the invention of the modern computer and basic programming techniques. As Matt Ford wrote for Ars back in 2007,

Turing machines are simple logic devices that can be made to simulate the logic of any standard computer that could be constructed. They consist of an infinite number of cells on a tape (the memory) and an active cell that is referred to as the "head." Each cell can be one of a set number of colors, and the head can have a fixed number of states. A set of rules determine how the combination of cell color and head state dictates what color should be written to the tape, what state the head should be placed in, and what direction it should move (left or right).
Click to expand...
A universal Turing machine is one capable of running any algorithm, while "Turing completeness" is a term "used to indicate that a system has a particular degree of complexity," said Churchill. "Any Turing-complete system is theoretically able to emulate any other." Being able to determine whether a given problem can be solved in principle is a key task in computer science. If Magic is Turing complete, then there should exist within the game a scenario where it's impossible to determine a winning strategy—equivalent to the famous "halting problem" in computer science
 
You must log in or register to reply here.