KnowraLambda calculusLinked fromLinked fromThe 23 pages that link to Lambda calculus, each with the reason it gives.All 23Broader topic 2Related 11Narrower topic 4Compared with 6Turing machineCompared with: It defines computability differently yet matches Turing machines in computational power.Alan TuringCompared with: Church’s independent model of computation reached results parallel to Turing’s.Halting problemCompared with: It offers a different model in which undecidable termination questions also arise.Universal Turing machineCompared with: It is a distinct formal model equivalent in computational power to Turing machines.Combinatory logicCompared with: It provides the variable-based notation that combinatory logic can eliminate.Turing's proofCompared with: Church’s lambda-calculus proof reaches the same undecidability conclusion without Turing machines.