scientific article; zbMATH DE number 4130139

zbMATH Open0689.90004MaRDI QIDQ3032030FDOQ3032030

Authors: Hans W. Gottinger 

Publication date: 1988

Title of this publication is not available (Why is that?)

Recommendations

• On effectively computable realizations of choice functions
• The Computational Complexity of Choice Sets
• Probabilistic computability and choice
• Computable choice functions for computable linear orderings
• Choice logics and their computational properties
• Computability beyond Church-Turing via choice sequences
• Complexity of representation-of-choice functions as compositions. Asymptotic estimates of complexity characteristics
• On the computational content of the axiom of choice
• Decision problems, complexity, traces, and representations

zbMATH Keywords

complexitysocial choicecomputabilityrecursive topological spaces

Mathematics Subject Classification ID

Social choice (91B14) Analysis of algorithms and problem complexity (68Q25)

Cited In (4)

• On effectively computable realizations of choice functions
• Computable preference and utility
• The Computational Complexity of Choice Sets
• The classification of preordered spaces in terms of monotones: complexity and optimization

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 Q3032030)