313 search results - page 1 / 63 » Formalizing the Halting Problem in a Constructive Type Theor... |
TYPES
2000
Springer
13 years 8 months ago
2000
Springer
We present a formalization of the halting problem in Agda, a language based on Martin-L
AMC
2006
13 years 4 months ago
2006
We first show that the Halting Function (the noncomputable function that solves the Halting Problem) has explicit expressions in the language of calculus. Out of that fact we elab...
ENTCS
2008
13 years 4 months ago
2008
This note is about work in progress on the topic of "internal type theory" where we investigate the internal formalization of the categorical metatheory of constructive ...
ICML
1996
IEEE
14 years 5 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
TPHOL
1999
IEEE
13 years 9 months ago
1999
IEEE
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. ...