Blog Archives

Algorithm to Solve Arranged Marriages via the Hall Theorem

May 8, 2012 at 10:27 am
marriage via algorithm

According to Hall's Marriage Theorem, a computer algorithm can correctly assign brides to grooms for optimum happiness. Dating services use computer programs to match prospective mates, but group matching by list is pure math theory.

Read more »

Is it Possible for Turing Machines to Solve the Halting Problem?

April 23, 2012 at 9:47 am
A Computer Magnetic Tape Drive is like a Turing Machine, by Steve Parker

Alan Turing (1912-1954) "invented" his Turing Machine to represent the process of making mathematical inferences. The penultimate goal was to determine whether the "Halting Problem" could be solved. So, what's the "Halting Problem?

Read more »

The Universal Turing Machine is a Turing Machine Emulator

March 29, 2012 at 2:21 pm
universal turing machine

Can one Turing machine emulate another? Are Turing machines guaranteed to finish a task? As Tolkien said about the advice that elves provide, the answer is “both yes and no.” Essentially, the Universal Turing machine represents the ability for a “computer” to manipulate a program just as it deals...

Read more »

The ACM Awards the 2011 Turing Prize for Computing to Judea Pearl

March 20, 2012 at 6:27 am
The Turing Award was first given in 1966: Image by julostock

The ACM Turing Award winner for 2011 is Judea Pearl. This computing award has been presented annually since 1966, with multiple recipients in some years. This year’s winner has advanced artificial intelligence by improving the way in which AI programs acquire additional information, among other things. The first winner...

Read more »

The Special Case of Non-Deterministic Turing Machines

February 28, 2012 at 9:00 am
Diagram of the double-slit experiment: Image by Koantum

Alan Turing (1912-1954) “invented” the Turing machine (TM) as a powerful theoretical model for mathematicians exploring rules-based mathematics. The  Non-deterministic Turing machine, or NTM, extends the basic concept by permitting multiple instructions for one state-input combination. The Deterministic Turing Machine A Turing machine has a finite number of states, symbols and instructions. A...

Read more »

About the author

Mike DeHaan

Mike DeHaan holds a Bachelor of Math in Computer Sciences. His experience includes years of Cobol programming and quality assurance in the Information Technology sector.

Subscribe

  • Facebook
  • Twitter
  • RSS Feed

website security