Turing's thesis

Show Summary Details

Quick Reference

The hypothesis, analyzed by Alan Turing in 1936, that any function on strings or the natural numbers that can be computed by an algorithm can be computed by a Turing machine. See also Church-Turing thesis.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.