scientific article
From MaRDI portal
Publication:3032030
zbMATH Open0689.90004MaRDI QIDQ3032030
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Recommendations
- On effectively computable realizations of choice functions 👍 👎
- Choice logics and their computational properties 👍 👎
- Probabilistic computability and choice 👍 👎
- Decision problems, complexity, traces, and representations 👍 👎
- The Computational Complexity of Choice Sets 👍 👎
- Complexity of representation-of-choice functions as compositions. Asymptotic estimates of complexity characteristics 👍 👎
- On the computational content of the axiom of choice 👍 👎
- Computable choice functions for computable linear orderings 👍 👎
- Computability Beyond Church-Turing via Choice Sequences 👍 👎
This page was built for publication:
