Questions tagged [open-ended-function]

For challenges where an exact output is not required but some property must still be fulfilled.

2 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
11 votes
0 answers

NP-complete reduction: (grid-)Hamiltonian circuit

Background Hamiltonian circuit problem is a decision problem which asks whether a given graph has a Hamiltonian circuit, i.e. a cycle that visits every vertex exactly once. This problem is one of the ...
Bubbler's user avatar
  • 73.8k
6 votes
0 answers

Give the best Chaitin incompleteness bound

This was originally a pure mathematics question, but I think I've got the best chance for an answer here. The Challenge For concreteness, consider Peano Arithmetic (PA). For some language L of your ...
Charles Wang's user avatar