Defining effectiveness using finite sets. A study on computability

DOI10.1016/J.ENTCS.2016.09.009MaRDI QIDQ529651zbMATH OpenOpenAlexWikidataFDO

Authors Alex Garcia, Hugo Daniel Macedo, Edward Hermann Haeusler

Publication date 19 May 2017

Full work available at URL https://doi.org/10.1016/j.entcs.2016.09.009

zbMATH Keywords

effectivenessfinite setsmodels of computation

Mathematics Subject Classification ID

Recommendations

• A Natural Axiomatization of Computability and Proof of Church's Thesis
• scientific article; zbMATH DE number 4191113
• On computably enumerable structures
• Effective domains and concrete computability: A survey
• Formalizing abstract computability: Turing categories in Coq

Cites work

• scientific article; zbMATH DE number 3825806 (Why is no real title available?)
• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• scientific article; zbMATH DE number 53544 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 1840601 (Why is no real title available?)
• scientific article; zbMATH DE number 1390335 (Why is no real title available?)
• scientific article; zbMATH DE number 3335016 (Why is no real title available?)
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• Categories and Computer Science

Cited in

(2)

• Changing the logic without changing the subject: the case of computability
• scientific article; zbMATH DE number 7453165 (Why is no real title available?)

Describes a project that uses

Uses Software

• Specware

This page was built for publication: Defining effectiveness using finite sets. A study on computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q529651)