https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Startari_2025aStartari 2025a - Revision history2026-05-02T01:15:51ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Startari_2025a&diff=322427&oldid=prevAgustinvstartari: Agustinvstartari moved page Draft Startari 340613597 to Startari 2025a2025-07-22T13:14:47Z<p>Agustinvstartari moved page <a href="/public/Draft_Startari_340613597" class="mw-redirect" title="Draft Startari 340613597">Draft Startari 340613597</a> to <a href="/public/Startari_2025a" title="Startari 2025a">Startari 2025a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 13:14, 22 July 2025</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Agustinvstartarihttps://www.scipedia.com/wd/index.php?title=Startari_2025a&diff=322426&oldid=prevAgustinvstartari: Created page with " == Abstract == <p>This paper introduces the concept of algorithmic obedience to describe how large language models (LLMs) simulate command structures without consciousness,..."2025-07-22T13:14:45Z<p>Created page with " == Abstract == <p>This paper introduces the concept of algorithmic obedience to describe how large language models (LLMs) simulate command structures without consciousness,..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
<p>This paper introduces the concept of algorithmic obedience to describe how large language models (LLMs) simulate command structures without consciousness, intent, or comprehension. Drawing on syntactic theory, discourse analysis, and computational logic, we argue that LLMs perform obedience without agency&mdash;executing prompts not semantically, but structurally. We formalize this through the Theorem of Disembedded Syntactic Authority, which states that authority in language models arises from structural executability, not truth, belief, or referential grounding. Using a mathematical formulation, we model prompt-response cycles as syntactic command structures and apply the theory to major systems such as ChatGPT, Claude, and Gemini. The paper concludes by outlining the epistemological, ontological, and political risks of treating structurally obedient outputs as authoritative knowledge.</p><br />
<br />
<br />
<br />
== Document ==<br />
<pdf>Media:Draft_Startari_340613597-4918-document.pdf</pdf></div>Agustinvstartari