Unverified50% confidenceFactExact time
The oracle construction was introduced by Turing in 1939 to study computability relative to a set.
1
Sources
50%
Confidence
Long-term
Relevance
10/14/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe Curry–Howard correspondence reveals the structural correspondence in which propositions correspond to types, proofs correspond to programs, and proof normalization corresponds to program execution, and was gradually discovered between 1934 and 196957% similarUnverifiedAutomated theorem proving (ATP) is a research field with decades of history; early representative systems include the Logic Theorist and the Resolution Prover from the 1950s.57% similarUnverifiedLambda calculus was proposed by Alonzo Church in the 1930s and is equivalent in computational power to the Turing machine.56% similarUnverified图灵在1936年提出的通用图灵机概念蕴含了计算系统描述和模拟自身的思想55% similarUnverifiedThe concept of cellular automata was first proposed by mathematicians John von Neumann and Stanislaw Ulam in the late 1940s, originally used to study self-replicating biological systems.53% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1026911API
curl https://kongchang.com/api/v1/knowledge/claims/1026911MCP
get_claim(id=1026911)