The Model (TM) = Turing Machine (TM)

[ed note: this is for people who have read some of my book.  I’m about to update all the free chapters and add the fourth one, so this could be considered a bit of pre-ambles, or teaser, before I get to that.]

So I was doing a bit of reading about some stuff and wanted to make something clear about my book (and this is mainly for Marty…you handsome devil, you).  What I am describing in the mathematical and computational chapters of the book (i.e. the phyiscs I use as meta-physics) is what is called a “Turing Machine.”   My concept of a Turing Machine (TM) is called in my book, “The Model” (TM), and it is used to calculate things, including itself.

That last bit is the tricky part of designing a good model (err, a perfect one…or as close to perfect as possible), and I think that might be where many people become confused.   Luckily, I’ve provided a couple of appendices on recursion and hope people read them.

Main point of this post is simply this, TM = TM.  Got it?

In Defense of Love, Part II (the Fusion bit, charging now…)

To catch up to this discussion quickly, one has to but read this post and the comments.

Then this post, and the comments.

And then this post, and the comments. If you do that, you should be all caught up.

In response to my previous post, “In Defense of Love”, I also received an email on the subject from a friend of mine who wishes to remain anonymous.   That email will not be shared in full, but I will quote portions of it here.

As I asked for his permission to share that email, under that condition, and he acquiesced, I will be combining both responses to my “gauntlet” in the response posted here.

Sorry, if this gets a bit confusing, but it is often difficult to catch up to a conversation already in progress, as the Dude once said “Donny, you’re out of your element!”

Once you have caught up, feel free to click/scroll past “the jump” and continue reading…

“The Jump”

Continue reading