This is stars and forks stats for /uds-psl/coq-library-undecidability repository. As of 29 Mar, 2024 this repository has 96 stars and 24 forks.
Coq Library of Undecidability Proofs The Coq Library of Undecidability Proofs contains mechanised reductions to establish undecidability results in Coq. The undecidability proofs are based on a synthetic approach to undecidability. A problem P is considered undecidable if its decidability in Coq implies the enumerability of the complement of halting problem for Turing machines (SBTM_HALT in TM/SBTM.v). Since the Turing machine halting is enumerable (SBTM_HALT_enum in TM/SBTM_enum.v), enumerability...
Coq Library of Undecidability Proofs The Coq Library of Undecidability Proofs contains mechanised reductions to establish undecidability results in Coq. The undecidability proofs are based on a synthetic approach to undecidability. A problem P is considered undecidable if its decidability in Coq implies the enumerability of the complement of halting problem for Turing machines (SBTM_HALT in TM/SBTM.v). Since the Turing machine halting is enumerable (SBTM_HALT_enum in TM/SBTM_enum.v), enumerability...
repo | techs | stars | weekly | forks | weekly |
---|---|---|---|---|---|
snu-sf/paco | CoqPythonOther | 38 | 0 | 10 | 0 |
coq-community/lemma-overloading | CoqJavaScriptCSS | 26 | 0 | 6 | 0 |
samih93/e_commerce_app | DartOther | 63 | 0 | 28 | 0 |
jyotirmoy-paul/planets | DartC++CMake | 85 | 0 | 32 | 0 |
emacs-ess/ESS | Emacs LispROther | 606 | 0 | 181 | 0 |
alfonsogarciacaro/Feliz.Solid | F#Other | 48 | 0 | 1 | 0 |
lanl/Fierro | GLSLC++Other | 13 | 0 | 10 | 0 |
livekit/livekit | GoOther | 5.8k | 0 | 475 | 0 |
nathants/libaws | GoShellOther | 438 | 0 | 8 | 0 |
google-research/dex-lang | HaskellPythonJulia | 1.5k | 0 | 107 | 0 |