Texonom
Texonom
/
Engineering
Engineering
/Data Engineering/Artificial Intelligence/AI Term/Turing Test/
Extended Church Turing Thesis
Search

Extended Church Turing Thesis

Creator
Creator
Seonglae Cho
Created
Created
2023 Jul 5 16:51
Editor
Editor
Seonglae Cho
Edited
Edited
2024 Apr 21 1:57
Refs
Refs
Complexity Theory

Feasibility thesis

Quantum Computing
을 포함하면 모든 현상을 계산으로 시뮬레이션 가능하다는 믿음
Simulation Cosmology
whether an arbitrary but "reasonable" model of computation can be efficiently simulated
 
 
 
 
Church–Turing thesis
In computability theory, the Church–Turing thesis (also known as computability thesis,[1] the Turing–Church thesis,[2] the Church–Turing conjecture, Church's thesis, Church's conjecture, and Turing's 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 are computable by paper-and-pencil methods. In the 1930s, several independent attempts were made to formalize the notion of computability:
Church–Turing thesis
https://en.wikipedia.org/wiki/Church–Turing_thesis
 
 

Recommendations

Texonom
Texonom
/
Engineering
Engineering
/Data Engineering/Artificial Intelligence/AI Term/Turing Test/
Extended Church Turing Thesis
Copyright Seonglae Cho