Church–Turing thesis
id:
church-turing-thesis-231-2140988
title:
Church–Turing thesis
text:
In computability theory, the Church–Turing thesis is a thesis about the nature of computable functions. It states that a function on the natural numbers can be calculated by an effective method if and only if it is computable by a Turing machine. The thesis is named after American mathematician Alonzo Church and the British mathematician Alan Turing. Before the precise definition of computable function, mathematicians often used the informal term effectively calculable to describe functions that
brand slug:
wiki
category slug:
encyclopedia
description:
Thesis on the nature of computability
original url:
https://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis
date created:
2001-10-31T01:49:10Z
date modified:
2024-09-15T21:05:51Z
main entity:
{"identifier":"Q309157","url":"https://www.wikidata.org/entity/Q309157"}
image:
fields total:
13
integrity:
15