Defining a Decidability Decider for the Halting Problem

Download Edit this record How to cite View on PhilPapers
Abstract
When we understand that every potential halt decider must derive a formal mathematical proof from its inputs to its final states previously undiscovered semantic details emerge. When-so-ever the potential halt decider cannot derive a formal proof from its input strings to its final states of Halts or Loops, undecidability has been decided. The formal proof involves tracing the sequence of state transitions of the input TMD as syntactic logical consequence inference steps in the formal language of Turing Machine Descriptions.
PhilPapers/Archive ID
OLCDAD-3
Upload history
First archival date: 2018-02-20
Latest version: 9 (2018-02-28)
View other versions
Added to PP index
2018-02-20

Total views
153 ( #40,894 of 68,971 )

Recent downloads (6 months)
16 ( #45,120 of 68,971 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.