mistyfox812 said:I laid out my mathematical model for self-reference for you, and I’m sticking to my guns—it’s totally analogous to yours. Functions don't really have an initial "value" either; they just describe a specific logical structure. It's a program, much like your sentence. Except one runs on a processor, and the other runs on your brain.
Variables are part of the syntax here, so they aren't even relevant.
Besides, recursive functions can be expressed linearly, and I only used Pi as an example for a more recognizable algorithm. Just because it "goes somewhere" doesn't mean it isn't looping. Complex loops are still loops.
It’s not analogous. Or rather, it is, but only on a surface level that doesn't matter here.
A recursive function only looks self-referential because of the mathematical syntax used to describe it, but that isn't a problem since everyone implicitly understands how it works.
It DOES NOT act ON ITSELF!!! It acts on the previous step, the preceding operation. So even if the symbols are identical, everyone knows it represents an action—an operation performed not on itself, but on the prior result.
The fact that a function doesn't have an initial value as such, but instead represents a quantitative relationship or an operation, is irrelevant because you always have to "inject" some value into a function for it to start processing anything.
Syntax only matters if its meaning, or semantic content, is clear. Mathematical syntax is sometimes, strictly speaking, ambiguous, but that’s not an issue because everyone knows what it means. With recursion, there is no "looping in circles," just the repetition of an operation on a previous result.
It might seem the same to you because the logical progression of the sentence "this sentence is false" always operates on the previous result,
BUT you failed to notice that the self-reference of that sentence isn't in that repetition, but in the initial statement itself.
This probably seems similar to a recursive function to you because the syntax appears self-referential, but it isn't. It’s just an illusion created to save time, and everyone knows how it works even if the syntax is ambiguous.
A recursive function
never processes itself. It’s a process; it processes a number, then takes that result and does it again, and again...
A function is a description of an operation,
so the fact that it looks like it exists on both sides of the equals sign in mathematical notation isn't a sign of self-reference; it’s understood that this is just the previous phase of an iterative process.
With the sentence "this sentence is false," the initial statement is flawed because the "operation"—if we want to call it that—which is inherently a process of determining truth by matching the statement's content to something external to it, cannot function. The truth of the statement fails to connect to anything outside the statement right from the start.
So,
the initial CONDITION for the "truth operation" to be possible 😉
isn't met and the "function" this sentence represents is just pure nonsense.
It’s probably like when you write a function in math that means nothing—no meaningful operation at all—just an error that makes a mathematical expression nonsensical.
I'm no mathematician, but I'm pretty sure mathematicians can come up with stuff like that.
But LOOK, the further logical development of that initial statement keeps going because it is an operation that isn't contained within the initial statement, which already contains a broken "truth-determining" operation. The process spins in circles because it uses a logical procedure that is "outside" the initial statement, trying over and over to manufacture some sense out of a sentence that was nonsensical to begin with. So it's no wonder it never succeeds.
A valid logical statement has to be nothing more than an accurate description of something existing outside the statement itself. That’s the CONDITION, the AXIOM, if you want to call it that—it’s something you have to respect right from the jump. If you don't start there, then any further iterations aren't actually the result of some properly functioning recursive function. It’s just nonsense. You end up with a logical process that keeps trying and trying to fix things, but it can't, because it's fundamentally broken...
You really have to realize that the iteration of a logical process isn't built into the initial statement, unlike a recursive function where it’s implied. In this case, it's just the consequence of spinning your wheels in circles. It's just what happens when you have an error or some absurdity, which leads to this infinite loop of trying to correct that mistake. But logically speaking, it's just impossible.