scientific article; zbMATH DE number 627413

MaRDI QIDQ4304754zbMATH OpenFDO

Authors Kostas Skandalis

Publication date 31 August 1994

zbMATH Keywords

abstract computationinput setsordered fieldsoutput setsreal closed fieldsuncountable subfields of \(\mathbb{R}\)unordered fields

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Abstract and axiomatic computability and recursion theory (03D75) Ordered fields (12J15) Connections between field theory and logic (12L99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Ordered Rings Over Which Output Sets are Recursively Enumerable Sets
• Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable
• scientific article; zbMATH DE number 1285742
• scientific article; zbMATH DE number 4114603
• Computability over arbitrary fields

Cited in

(2)

• Ordered Rings Over Which Output Sets are Recursively Enumerable Sets
• Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable

This page was built for publication:

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