A non-expert view on Turing machines, Proof Verifiers, and Mental reasoning

Details A non-expert view on Turing machines, Proof Verifiers, and Mental reasoning A non-expert view on Turing machines, Proof Verifiers, and Mental reasoning

2010-10-30

arxiv.org/abs/1011.0046v6

Computer Science

Computational Complexity

Scientific paper

The paper explores known results related to the problem of identifying if a given program terminates on all inputs -- this is a simple generalization of the halting problem. We will see how this problem is related and the notion of proof verifiers. We also see how verifying if a program is terminating involves reasoning through a tower of axiomatic theories -- such a tower of theories is known as Turing progressions and was first studied by Alan Turing in the 1930's. We will see that this process has a natural connection to ordinal numbers. The paper is presented from the perspective of a non-expert in the field of logic and proof theory.

Affiliated with

Also associated with

No associations

Rating

A non-expert view on Turing machines, Proof Verifiers, and Mental reasoning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A non-expert view on Turing machines, Proof Verifiers, and Mental reasoning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A non-expert view on Turing machines, Proof Verifiers, and Mental reasoning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-405151