Original file (SVG file, nominally 500 × 600 pixels, file size: 14 KB)

Summary

Description
English: A Turing machine which solves the halting problem, built using a Turing machine which decides any nontrivial property about the language of a Turing machine. Used to illustrate the reduction which generates a contradiction to prove Rice's Theorem.
Date
Source Own work
Author Booyabazooka

Licensing

Public ___domain I, the copyright holder of this work, release this work into the public ___domain. This applies worldwide.
In some countries this may not be legally possible; if so:
I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

December 2008

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current02:17, 9 December 2008Thumbnail for version as of 02:17, 9 December 2008500 × 600 (14 KB)Chris-martin{{Information |Description={{en|1=A Turing machine which solves the halting problem, built using a Turing machine which decides any nontrivial property about the language of a Turing machine. Used to illustrate the reduction which generates a contradicti

The following page uses this file:

Global file usage

The following other wikis use this file: