Analog reducibility

DOI10.1093/LOGCOM/EXAB036OpenAlexW4206590802MaRDI QIDQ5163980

Author name not available (Why is that?)

Publication date: 9 November 2021

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exab036

zbMATH Keywords

superstructuresenumeration degreescontinuous logiccontinuous degreescomputable from a structure

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Related Items (1)

CONTINUOUS SENTENCES PRESERVED UNDER REDUCED PRODUCTS

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Reductions and quantization 👍 👎
• A new conceptual framework for analog computation 👍 👎
• The complexity of analog computation 👍 👎
• Rudimentary reductions revisited 👍 👎
• On the complexity of encoding in analog circuits 👍 👎
• Reductivity 👍 👎
• Scaling and universality of the complexity of analog computation 👍 👎
• Intrinsic Reducibilities 👍 👎

This page was built for publication: Analog reducibility

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