You are his peer, review it.
I'll be his peer on the network, and that's it.
I looked at the first couple of pages with more intensity, and briefly skimmed the rest to see if it was of similar quality. Waste of time.
I. Introduction
...
Any program that is Turing complete is by necessity Finite.
...
Can you explain what a Turing complete program is?
No - neither can the informed reader at that point, because Turing completeness has a well defined meaning which applies to 'a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton)'. The term is not usually applied to programs (sentences in a programming language).
No, you have to indulge in Craig's fancy to use an undefined term in the introduction to find out on p.2 that he defines it informally as
First, we define any Turing complete program to be a program that halts.
If at this point you haven't figured out that his earlier statement is complete bullshit, that may be because you have forgotten it already because you would have had to read a whole page of other stuff just to get to the definition. Or it may be because you can trivially think of a program that halts, but does not need to be finite.
Let's use BASIC to construct a program that clearly halts, but is infinite.
Code:
10 PRINT "THOU SHALT NOT CONFUSE THE READER"
20 END
30 PRINT "BUT I WANT TO!"
40 PRINT "NO, ITS NEVER OK"
50 PRINT "BUT I WANT TO!"
60 PRINT "ARE YOU GOING TO PLAY THIS GAME FOREVER?"
70 PRINT "I WILL IF YOU WILL!"
80 PRINT
90 PRINT
100 PRINT
... (and so on, for an infinite number of PRINT statements)
So I just demonstrated a "Turing complete program" that is not finite.
Hence clearly not "Any program that is Turing complete is by necessity Finite".
I did not really feel further rigorous review was deserved after such a mistake.
After all
from falsehood, anything follows.
Real scientists don't feel a need to take an established term like Turing completeness and use it in a redefinition like 'Turing complete program' when all that's meant is a program that halts.
If you mean a program that halts, call it a halting program like everyone else.
The rest of the paper comes across as an elaborate attempt to befuddle, or maybe just the expression of someone who is themselves befuddled, but thinks introducing new terms which borrow from established terms can sow enough confusion to make it seem like something very important has been said.
Sorry if this offends anyone here who can't tell the difference. That's my brief review.
[doublepost=1539483742][/doublepost]But I do have a question I can't seem to resolve.
If Craig is so smart, and is basically surrounded by people with PhD's themselves, why doesn't anyone help him to construct a paper which does not insult the reader?