On algorithmic unsolvability
From MaRDI portal
Recommendations
Cited in
(10)- Algorithms and algorithmic problems
- Oracle and interactive computations, post-Turing thesis and man-machine interactions
- Algorithmic complexity as a criterion of unsolvability
- Decision incorporation in meta-heuristics to cope with decision scheduling problems
- scientific article; zbMATH DE number 4031659 (Why is no real title available?)
- The universal algorithm
- scientific article; zbMATH DE number 1163980 (Why is no real title available?)
- Decidability and universality in the axiomatic theory of computability and algorithms
- scientific article; zbMATH DE number 3074851 (Why is no real title available?)
- From undecidability of non-triviality and finiteness to undecidability of learnability
This page was built for publication: On algorithmic unsolvability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3043796)