KnowraAlonzo ChurchLinked fromLinked fromThe 23 pages that link to Alonzo Church, each with the reason it gives.All 23Related 23Turing machineRelated: Church independently established the unsolvability of the decision problem using lambda calculus.Alan TuringRelated: Church supervised Turing’s doctoral work and independently solved the Entscheidungsproblem.Type theoryRelated: His work established foundational typed calculi for logic and computation.Halting problemRelated: His work provided a parallel route to the negative answer surrounding the Entscheidungsproblem.Church–Turing thesisRelated: His account of effective calculation preceded and helped shape the thesis.Computability theoryRelated: His 1936 work gave one formal proof that no general decision procedure exists.Computer scienceRelated: His formal system helped define which problems can be computed.Kurt GödelRelated: Church’s work established a parallel route to limits on formal decision procedures.Lambda calculusRelated: Church introduced the calculus in the 1930s as a formal account of functions and computation.Curry–Howard correspondenceRelated: Lambda calculus became the programming language side of the correspondence.EntscheidungsproblemRelated: Church published an impossibility proof for the Entscheidungsproblem in 1936.Universal Turing machineRelated: Church developed an independent framework for computability alongside Turing’s machine model.Functional programmingRelated: Lambda calculus provided a formal basis for function-centered computation.Analysis of algorithmsRelated: Formal models of computation underpin precise claims about what algorithms can do.Undecidable problemRelated: Church gave one of the first proofs that no general decision procedure exists.Donald KnuthRelated: Church’s mathematical logic is among the foundational ideas informing Knuth’s work on computation.Automata theoryRelated: Church's formalism and thesis developed alongside Turing's account of computability.Combinatory logicRelated: His lambda calculus became the main system compared with combinatory logic.Church–Rosser theoremRelated: The theorem bears his name and belongs to the calculus he developed.Theoretical computer scienceRelated: His formulation of effective computation converged with Turing's account.General recursive functionRelated: Church's formulation provided a major equivalent model of computability.History of computer scienceRelated: His formal account of computation developed independently alongside Turing’s.Turing's proofRelated: Church independently established the Entscheidungsproblem’s unsolvability using a different formalism.
KnowraAlonzo ChurchLinked fromLinked fromThe 23 pages that link to Alonzo Church, each with the reason it gives.All 23Related 23Turing machineRelated: Church independently established the unsolvability of the decision problem using lambda calculus.Alan TuringRelated: Church supervised Turing’s doctoral work and independently solved the Entscheidungsproblem.Type theoryRelated: His work established foundational typed calculi for logic and computation.Halting problemRelated: His work provided a parallel route to the negative answer surrounding the Entscheidungsproblem.Church–Turing thesisRelated: His account of effective calculation preceded and helped shape the thesis.Computability theoryRelated: His 1936 work gave one formal proof that no general decision procedure exists.Computer scienceRelated: His formal system helped define which problems can be computed.Kurt GödelRelated: Church’s work established a parallel route to limits on formal decision procedures.Lambda calculusRelated: Church introduced the calculus in the 1930s as a formal account of functions and computation.Curry–Howard correspondenceRelated: Lambda calculus became the programming language side of the correspondence.EntscheidungsproblemRelated: Church published an impossibility proof for the Entscheidungsproblem in 1936.Universal Turing machineRelated: Church developed an independent framework for computability alongside Turing’s machine model.Functional programmingRelated: Lambda calculus provided a formal basis for function-centered computation.Analysis of algorithmsRelated: Formal models of computation underpin precise claims about what algorithms can do.Undecidable problemRelated: Church gave one of the first proofs that no general decision procedure exists.Donald KnuthRelated: Church’s mathematical logic is among the foundational ideas informing Knuth’s work on computation.Automata theoryRelated: Church's formalism and thesis developed alongside Turing's account of computability.Combinatory logicRelated: His lambda calculus became the main system compared with combinatory logic.Church–Rosser theoremRelated: The theorem bears his name and belongs to the calculus he developed.Theoretical computer scienceRelated: His formulation of effective computation converged with Turing's account.General recursive functionRelated: Church's formulation provided a major equivalent model of computability.History of computer scienceRelated: His formal account of computation developed independently alongside Turing’s.Turing's proofRelated: Church independently established the Entscheidungsproblem’s unsolvability using a different formalism.