Matches in DBpedia 2016-04 for { ?s ?p "In constructive mathematics, Church's thesis (CT) is an axiom which states that all total functions are computable. The axiom takes its name from the Church–Turing thesis, which states that every effectively calculable function is a computable function, but the constructivist version is much stronger, claiming that every function is computable.The axiom CT is incompatible with classical logic in sufficiently strong systems."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Churchs_thesis_(constructive_mathematics) comment "In constructive mathematics, Church's thesis (CT) is an axiom which states that all total functions are computable. The axiom takes its name from the Church–Turing thesis, which states that every effectively calculable function is a computable function, but the constructivist version is much stronger, claiming that every function is computable.The axiom CT is incompatible with classical logic in sufficiently strong systems.".
- Q5116527 comment "In constructive mathematics, Church's thesis (CT) is an axiom which states that all total functions are computable. The axiom takes its name from the Church–Turing thesis, which states that every effectively calculable function is a computable function, but the constructivist version is much stronger, claiming that every function is computable.The axiom CT is incompatible with classical logic in sufficiently strong systems.".