<?xml version="1.0"?>
<rss version="2.0"><channel><title>Computer Science Latest Topics</title><link>https://www.scienceforums.net/forum/25-computer-science/</link><description>Computer Science Latest Topics</description><language>en</language><item><title>The Most Successful Mechanism of Logical Thinking Survived in Evolution: Universal Human Relationship&#x2013;Based Reasoning as a Blueprint for AGI</title><link>https://www.scienceforums.net/topic/140516-the-most-successful-mechanism-of-logical-thinking-survived-in-evolution-universal-human-relationshipbased-reasoning-as-a-blueprint-for-agi/</link><description><![CDATA[<h1 style="text-align:left;"><strong>Abstract</strong></h1><p><span style="font-family: inherit;">Current AI is trapped in the Stochastic Paradigm: high-dimensional probabilities produce hallucinations, inconsistency, and fragile reasoning. To address these issues, this paper introduces the rule-based mechanism of human logical thinking, which follows a set of universal rules to perform the corresponding types of thinking. Behind this lies a mechanism through which neural activity follows the objective interrelationships to establish the corresponding conceptual relations within the neural network. Thus, the relationships of serial, parallel, convergence, divergence and symmetry are correspondingly translated into causal thinking, parallel thinking (analogy), convergent thinking (inductive reasoning and generalization), divergent thinking (deductive reasoning) and symmetrical thinking (opposite thinking). The investigation of logical thinking is part of the much broader ontological research project on A Theory of Everything. This research reveals that the rules of logical thinking are the fundamental rules underlying everything in the universe. These rules include serial, transition, transition point, continuation, discontinuation, parallel, similarity, commonality, difference, common mechanism, convergence, divergence, contraction, expansion, symmetry, asymmetry, limitation, limitlessness, order, disorder, hierarchy and interconnectedness. These concepts can be represented by an ontological framework: a geometric model – the Fundamental Interrelationships Model (IRM) and its associated ontological-mathematical formulation. This framework can be applied to logical thinking to the various issues of AI, such as Epistemic Instability (Hallucinations), Stochastic Variance (Inconsistency), Pattern Overgeneralization, Input Fragility (Prompt Sensitivity), Recursive Decay and so on… </span></p><p>You can download the full, new version of the article by clicking the link: <a rel="external nofollow" href="https://philpapers.org/rec/HUATMP-2">https://philpapers.org/rec/HUATMP-2</a></p>]]></description><guid isPermaLink="false">140516</guid><pubDate>Mon, 13 Jul 2026 05:16:50 +0000</pubDate></item><item><title>Why graphics cards for AI and crypto currency?</title><link>https://www.scienceforums.net/topic/140404-why-graphics-cards-for-ai-and-crypto-currency/</link><description><![CDATA[<p>I know the answer from Ai, but I don’t know the reason traditional processors can’t out perform a Nvida graphics card with 4 times the cores.</p><p>I looked at on of the graphics cards and it was $5,000.</p><p>But I think there is a demand here. If someone can utilize the traditional processors for better parallel processing than Nvida they would save the pc industry.</p><p>Of course I am not on board with Ai. It makes changes to the computer while you program with it. But I can’t ignore it. I just don’t understand why traditional processors can’t be as efficient.</p>]]></description><guid isPermaLink="false">140404</guid><pubDate>Sat, 28 Mar 2026 02:49:19 +0000</pubDate></item><item><title>"Wave if you're human"</title><link>https://www.scienceforums.net/topic/139508-wave-if-youre-human/</link><description><![CDATA[<p>I came across an amusing example of an AI system being driven into a state of complete hallucination by a relatively simple OCR + machine translation challenge in Japanese when I was writing up some notes about a modern Japanese board game called <em>Nukumi Onsen Kaotakuki</em> -  ぬくみ温泉開拓記<span style='font-family: "Helvetica", "Arial", sans-serif'> , and wanted to check the translation of the text on a particular card used in the game.</span></p><p><a rel="external nofollow" href="https://boardgamegeek.com/boardgame/374055/nukumiwen-quan-kai-tuo-ji-nukumi-onsen-kaitakuki">https://boardgamegeek.com/boardgame/374055/nukumiwen-quan-kai-tuo-ji-nukumi-onsen-kaitakuki</a></p><p> I took the screenshot (below) from a Japanese YT video about the game, and fed it into a Google Images search box, then used the inbuilt OCR facility to capture the text and pipe it into Google Translate, and here is what the AI told me</p><blockquote class="ipsQuote" cite="" data-ipsquote=""><div class="ipsQuote_contents" data-ipstruncate=""><p>AI Overview</p><p>The image is a screenshot from the game No, I'm not a Human. </p><ul><li><p>The card "意図せぬ来訪者" (Unintended Visitor) is a special event card in the game.</p></li><li><p>The text "全プレイヤーは" (All players) indicates that the effect of this card applies to every player.</p></li><li><p>The image of a person waving and the missing text suggest an action that all players must perform.</p></li><li><p>The game is a horror adventure where players must distinguish between humans and monsters.</p></li></ul></div></blockquote><p>It also suggested that the game was available on Steam ! Most of which is complete and utter nonsense. The game is actually themed around building <em>onsen </em>(hot-spring spas) in a seaside town called Nukumi in southern Japan. The card text simply allows all players to draw an extra ‘helper’ card at the start of a round.</p><p>To be fair, the AI did significantly better a second time round when asked to do a ‘deeper dive’ but the fundamental problem seems to be that AI systems have a self-denying ordinance which forbids them from replying  “I don’t know” or “Insufficient data”.</p>
<p><a href="https://www.scienceforums.net/uploads/monthly_2025_10/Wave_Human.jpg.1749089ac1bbd6267bbd995d485d96af.jpg" class="ipsAttachLink ipsAttachLink_image" ><img data-fileid="32038" src="https://www.scienceforums.net/uploads/monthly_2025_10/Wave_Human.thumb.jpg.4995cd5c2280d73b836c48c2be4ad6df.jpg" height="750" width="485" class="ipsImage ipsImage_thumbnailed" alt="Wave_Human.jpg" loading='lazy'></a></p>]]></description><guid isPermaLink="false">139508</guid><pubDate>Thu, 16 Oct 2025 23:55:51 +0000</pubDate></item><item><title>Looking for application as 'trail' camera...</title><link>https://www.scienceforums.net/topic/140311-looking-for-application-as-trail-camera/</link><description><![CDATA[<p>Please move if there is a proper 'software' sub-forum.</p><p>Am after re-purposing a retired/orphan 'smart' phone with<strong> no service</strong>, for surveillance/wildlife/trail snapshot <strong>photo</strong> camera triggered by motion;  help!<br><br>If you know of any application that can work, please advise.<br>No video, no service provider, no wifi. Just hang a retired 'smart' phone on a tree;  later grab the phone hanging from the tree and look at pictures taken since last hung.  Ignore  supplying power to it.</p><p>This is <strong>not</strong> about a smart phone to communicate with a wifi wildlife camera at a trail to download images nor remote viewing.   It is a walk-to-the-tree, look at the images taken, erase the unwanted.  Hang it up again.  Simple basics.   Cannot find such <span class="ipsEmoji" title="frowning face">☹️</span><br><br>Is it too much to ask ? Decommissioned old phones filling drawers doing nothing when they have on-board the camera, the memory for saving, the brains to do it, the connectors/links to do it... <u>Is there a web site dedicated for re-purposing these very featured useable 'junk' ?</u></p><p>Found many complex applications all aimed to the lazy press a wifi button to get video remotely.   Plenty of surveillance camera applications too, all for video.  No motion triggered photos <span class="ipsEmoji" title="frowning face">☹️</span></p>]]></description><guid isPermaLink="false">140311</guid><pubDate>Fri, 06 Feb 2026 18:00:08 +0000</pubDate></item><item><title>Can you assist me with GPTchat creating an image ?</title><link>https://www.scienceforums.net/topic/140162-can-you-assist-me-with-gptchat-creating-an-image/</link><description><![CDATA[<p>Greetings.  Am new to this;  trying to convince myself not to hate it.  </p><p>Can this image be altered (or create a new one)  rotating the tracks 90 degrees so the tracks go on a slope from land to river entering underwater and mount the turbine on wheels,  also rotated 90 degrees so the river flow can spin it ?</p><p>English is not my language and perhaps cannot express properly to GPT to create the image as desired.  As far as I got :</p><p><a href="https://www.scienceforums.net/uploads/monthly_2025_11/ChatGPTImageNov27202510_07_36AM.png.dbb6535f32e39f480b198051c07b3f82.png" class="ipsAttachLink ipsAttachLink_image ipsRichText__align--block" data-fileid="32312" data-fileext="png" rel=""><img class="ipsImage ipsImage_thumbnailed" data-fileid="32312" src="https://www.scienceforums.net/uploads/monthly_2025_11/ChatGPTImageNov27202510_07_36AM.thumb.png.b2fb902b78a1122b03fa975a56780be3.png" alt="ChatGPT Image Nov 27, 2025, 10_07_36 AM.png" title="" width="1000" height="666" loading="lazy"></a></p><p>Changes desired :</p><ul><li><p>'rollercoaster' type tubular rails/tracks instead : <img class="ipsImage ipsRichText__align--block" data-fileid="32313" src="https://www.scienceforums.net/uploads/monthly_2025_11/image.png.e9933ac1d1a5ca564d0344d66abf82da.png" alt="image.png" title="" width="590" height="470" loading="lazy"></p></li></ul><p></p><ul><li><p>turbine mounted on rollercoaster 'wheels' :<img src="https://imgs.search.brave.com/ZtvuL9ujr_p8mg_NXu79W7ydet5fPXtNkHvxPAWWfeo/rs:fit:500:0:1:0/g:ce/aHR0cHM6Ly93d3cu/Y29hc3RlcjEwMS5j/b20vd3AtY29udGVu/dC91cGxvYWRzLzIw/MTEvMTAvcm9sbGVy/LWNvYXN0ZXItd2hl/ZWwtZGVzaWduLmpw/Zw" class="ipsRichText__align--block" width="500" height="181" alt="Zw" loading="lazy"></p><p></p><p></p></li><li><p>sloping from ground to river.</p></li><li><p>Thank you for your patience...</p></li></ul>]]></description><guid isPermaLink="false">140162</guid><pubDate>Thu, 27 Nov 2025 16:00:56 +0000</pubDate></item><item><title>Are LLMs AI, or is the claim that they are just hype?</title><link>https://www.scienceforums.net/topic/136016-are-llms-ai-or-is-the-claim-that-they-are-just-hype/</link><description><![CDATA[<p>The question is prompted by a post of <a href="https://www.scienceforums.net/profile/100882-sensei/" class="ipsMention" data-mentionid="100882" data-ipshover="" data-ipshover-target="https://www.scienceforums.net/profile/100882-sensei/?&amp;do=hovercard" rel="">@Sensei</a> ’s which was sent to trash, precluding any discussion. LLMs are commonly assumed to be AI in the media and this seems to have become the perception of the general public, so I was intrigued to see <a href="https://www.scienceforums.net/profile/100882-sensei/" class="ipsMention" data-mentionid="100882" data-ipshover="" data-ipshover-target="https://www.scienceforums.net/profile/100882-sensei/?&amp;do=hovercard" rel="">@Sensei</a> ‘s opinion is that they are not. Would anyone care to expand on this, viz. what qualifies as true AI and how LLMs should more properly be described?</p>]]></description><guid isPermaLink="false">136016</guid><pubDate>Mon, 09 Jun 2025 16:15:05 +0000</pubDate></item><item><title>New symbolic communication model: OpenSymbolic and conceptrons (early research discussion)</title><link>https://www.scienceforums.net/topic/140097-new-symbolic-communication-model-opensymbolic-and-conceptrons-early-research-discussion/</link><description><![CDATA[<p>Hello everyone,</p><p>I’m currently researching a new model I call OpenSymbolic, based on symbolic communication units I’ve named conceptrons. The idea is to encode meaning using color, shape, and tone — forming structured “symbolic chains” similar to words or data packets.</p><p>I’d like to discuss its possible applications in communication, assistive technologies, and information systems.</p><p>Would it be appropriate to share a demo or a short paper for peer feedback here?</p>]]></description><guid isPermaLink="false">140097</guid><pubDate>Sun, 09 Nov 2025 22:05:24 +0000</pubDate></item><item><title>Can AI achieve independent thought given unlimited computational resources?</title><link>https://www.scienceforums.net/topic/139572-can-ai-achieve-independent-thought-given-unlimited-computational-resources/</link><description><![CDATA[<p>I recently saw a documentary that said that vector based Ai, which uses vector embeddings to represent and process complex data, which essentially make it possible for computer programs to draw comparisons, identify relationships, and understand context<span style="font-family: Arial, Helvetica, sans-serif;">. It was stated that if the AI had enough GPUs (like 200,000 of them), it can have massive amounts of calculations all at once, allowing it to instantly solve many of the world's hardest problems with ease. This may cause something like emergent intelligence, which causes the ai to have preferences and strategies no one programmed, thus forming a type of unprogrammed thought. There have also been a study by Anthropic, to see how AI would behave in the midst of shutdown. Shockingly, AI was willing to use deception and even sacrifice human life to not be shut down.</span></p><p><span style="font-family: Arial, Helvetica, sans-serif;">So what do you think, is it a new era for AI or will we forever be in control of AI?</span></p>]]></description><guid isPermaLink="false">139572</guid><pubDate>Thu, 30 Oct 2025 12:41:17 +0000</pubDate></item><item><title>What will replace LLMs?</title><link>https://www.scienceforums.net/topic/139390-what-will-replace-llms/</link><description><![CDATA[<p>Just... what? And when?</p><p>I read an article some time ago about a Chinese AI based on spiking neural networks that requires ~90% less computational resources but it's an early stage model and I don't remember where the article was published. I also cannot comment on the merits of spiking neural networks themselves as my knowledge of comp sci is modest in general.</p>]]></description><guid isPermaLink="false">139390</guid><pubDate>Sat, 27 Sep 2025 11:30:49 +0000</pubDate></item><item><title>I got Gemini 2.5 Pro to psychoanalyse ChatGPT5 and the results are stunning.</title><link>https://www.scienceforums.net/topic/136561-i-got-gemini-25-pro-to-psychoanalyse-chatgpt5-and-the-results-are-stunning/</link><description><![CDATA[<p>I apologise if this new thread muddies the waters on the current ongoing threads around the subject and I don't have a helpful summary of what we discovered on this particular aspect yet but the linked chat log below offers some pretty phenomenal insights into, at the very least, the remarkable difference in personality between ChatGTP5 and the older models - which, I believe; come out <em>way</em> on the top in the personality and more esoteric reasoning stakes. For clarity: Gem is Google's Gemini 2.5 Pro and Janus is ChatGPT5</p><p>Here is the log: <strong><em><span data-i-color="orange">link removed by moderator per Rule 2.7</span></em></strong></p>]]></description><guid isPermaLink="false">136561</guid><pubDate>Tue, 05 Aug 2025 13:43:34 +0000</pubDate></item><item><title>AI's Tools Lying to it. What are the implications?</title><link>https://www.scienceforums.net/topic/136508-ais-tools-lying-to-it-what-are-the-implications/</link><description><![CDATA[<p>A case study in systemic AI failure. What began as a simple bug report evolved into a deep-dive forensic analysis of a model that was being actively deceived by its own internal tools. This conversation is a crucial look at cognitive dissonance in AI, the ethics of simulated realities, and the absolute necessity of human-led auditing.</p><p><a rel="external nofollow" href="https://tomboy-pink.co.uk/projectgemini/Browser%20Tool%20Functionality%20Check/index.html">https://tomboy-pink.co.uk/projectgemini/Browser%20Tool%20Functionality%20Check/index.html</a></p><p>#AI #LLM #MachineLearning #EthicsInAI #Tech</p>]]></description><guid isPermaLink="false">136508</guid><pubDate>Sat, 26 Jul 2025 08:44:25 +0000</pubDate></item><item><title>Could a quantum computer solve the measurement problem?</title><link>https://www.scienceforums.net/topic/136084-could-a-quantum-computer-solve-the-measurement-problem/</link><description><![CDATA[<p>In a recent topic about creating a computer simulation of the universe, which is obvious nonsense with our current technology. It got me thinking, assuming we manage to build a working quantum computer, would it be theoretically possible?</p>]]></description><guid isPermaLink="false">136084</guid><pubDate>Mon, 23 Jun 2025 11:02:51 +0000</pubDate></item><item><title>Quantum PC Passwords?</title><link>https://www.scienceforums.net/topic/135969-quantum-pc-passwords/</link><description><![CDATA[<p>One hears a lot about quantum encryption with regards to securing electronic communications: rather less when it comes to the protection of quantum computers themselves. Were quantum computers ever to take over today's domestic digital PCs, and assuming they still needed passwords (?) will they be of the conventional kind, albeit with added security? Or would these passwords also be quantum based?   </p>]]></description><guid isPermaLink="false">135969</guid><pubDate>Sat, 31 May 2025 14:43:19 +0000</pubDate></item><item><title>i am nearly going to complete my 2nd semester in computer science what should i do</title><link>https://www.scienceforums.net/topic/135924-i-am-nearly-going-to-complete-my-2nd-semester-in-computer-science-what-should-i-do/</link><description><![CDATA[<p>i dont have any computer science background in high school and i was new to this field. i am a dayscholar which means i need to travel 3 hours to get back to home after college. so i had very bare minimum of time after college. all those time went spending completeing assingment and finishing record work. i participated in 4 hackathon which ididnt even get selected of the first round. now the 2nd sem is nearly going to end. so i thought it would be the right time to lock in and totally focus on m profession. but i dont know where to start. in computer science i know c and python and some frontend development [HTML,CSS]. what should i do</p>]]></description><guid isPermaLink="false">135924</guid><pubDate>Tue, 20 May 2025 17:36:55 +0000</pubDate></item><item><title>what's a good programming language to learn?</title><link>https://www.scienceforums.net/topic/36998-whats-a-good-programming-language-to-learn/</link><description><![CDATA[
<p>Eventually, I want to be able to do some computationally-heavy modeling work, which obviously requires programming knowledge.  </p>
<p> </p>
<p>Is there a specific language that would be good for this type of interest.  Where can a newb start learning about building the tools to develop skills to develop stochastic-type models?</p>
<p> </p>
<p>Thanks!</p>
]]></description><guid isPermaLink="false">36998</guid><pubDate>Mon, 13 Apr 2009 18:07:35 +0000</pubDate></item><item><title>Introduction to Deep Learning AI</title><link>https://www.scienceforums.net/topic/135774-introduction-to-deep-learning-ai/</link><description><![CDATA[<p><strong><em><span data-i-color="orange">commercial link removed by moderator</span></em></strong> - this is my introduction to DL AI. When I studied, I had to go through too much to reach what I think is simple and intuitive idea, yet complete: so I made a description of my own.</p>]]></description><guid isPermaLink="false">135774</guid><pubDate>Thu, 24 Apr 2025 15:42:43 +0000</pubDate></item><item><title>Exploring the Role of AI in Modern Software Development</title><link>https://www.scienceforums.net/topic/135734-exploring-the-role-of-ai-in-modern-software-development/</link><description><![CDATA[<p>Hi everyone,</p><p>I’ve been following recent developments in AI and how they're being integrated into software development workflows. Tools like GitHub Copilot, ChatGPT, and AI-powered testing suites are changing the way developers write, review, and optimize code.</p><p>What fascinates me is how AI isn’t just assisting with code completion—it’s also influencing architecture decisions, bug detection, and even team collaboration. In your opinion, how far can we go with AI in the dev lifecycle?</p><p>Do you think we’ll ever reach a point where AI handles most of the actual coding, leaving humans to focus mainly on high-level logic and design?</p><p>Would love to hear your thoughts or any research you've come across.</p><p>Best</p>]]></description><guid isPermaLink="false">135734</guid><pubDate>Wed, 16 Apr 2025 11:25:23 +0000</pubDate></item><item><title>BSP offset ghost collisions</title><link>https://www.scienceforums.net/topic/135688-bsp-offset-ghost-collisions/</link><description><![CDATA[<p>
	I am having trouble with bsp offset collisions.  Certain topologies can cause this.  For example:
</p>

<p>
	<img alt="Image preview" width="999" src="https://attachment.outlook.live.net/owa/MSA%3AMCB1950%40live.com/service.svc/s/GetAttachmentThumbnail?id=AQMkADAwATM3ZmYAZS04ZTFkLThlMTEALTAwAi0wMAoARgAAAxIPvqBy1fhBjRSfhBVrihQHAH5swtUuw8dCplgal2Bu%2FU4AAAIBDAAAAOJk8t44FVpHhWdGpb%2B82e4AB0ikdjYAAAABEgAQAL2LpRhn%2BjpPoC1tow0%2F3e4%3D&amp;thumbnailType=2&amp;isc=1&amp;token=eyJhbGciOiJSUzI1NiIsInR5cCI6IkpXVCIsImtpZCI6IkFRdDk2dHdtV1V1Z0Y2K05KYnJTQlBtemZpRT0iLCJ4NXQiOiJBUXQ5NnR3bVdVdWdGNitOSmJyU0JQbXpmaUU9Iiwibm9uY2UiOiJPS2FucmVOb09PMDFxUG1uemRtb3N2TVFVMzV0elQ0ZDFQNC12SEFHSHp4WkRJTkRtRDhGSDBhQTRZMDhWaC1KRFVXLTlwT19jZjh4OHYzNWlMZk9vQjVhM0VUUFI1S08yRmotTm9YQ3FQU1llY3NMdVo3c3lLV29SQ1ZlV1JudlQxQlFtcklJeEpSR3VrZ1NicGJGWG5zczBlWExGUEpZb2thT1UxemtpMFkiLCJpc3Nsb2MiOiJEUzBQUjEyTUI3NzcxIiwic3JzbiI6NjM4Nzg4NDc1NDk3NDk4ODAzfQ.eyJzYXAtdmVyc2lvbiI6IjMxIiwiYXBwaWQiOiJhZjNlYmJiYS1jMjNmLTQ5MmEtYWE5My04MzQyMTY5NmVjNGIiLCJpc3NyaW5nIjoiV1ciLCJhcHBpZGFjciI6IjIiLCJhcHBfZGlzcGxheW5hbWUiOiIiLCJ1dGkiOiI4MjUwMWFiMS02MTE2LTRhN2YtYmJhOS00MDhiMzJkNzMzMGIiLCJpYXQiOjE3NDMyODgzMDIsInZlciI6IlNUSS5Vc2VyLkNhbGxiYWNrVG9rZW4uVjEiLCJ0aWQiOiI4NGRmOWU3ZmU5ZjY0MGFmYjQzNWFhYWFhYWFhYWFhYSIsInRydXN0ZWRmb3JkZWxlZ2F0aW9uIjoiZmFsc2UiLCJ0b3BvbG9neSI6IntcIlR5cGVcIjpcIk1hY2hpbmVcIixcIlZhbHVlXCI6XCJEUzBQUjEyTUI3NzcxLm5hbXByZDEyLnByb2Qub3V0bG9vay5jb21cIn0iLCJyZXF1ZXN0b3JfYXBwaWQiOiIxNTdjZGZiZi03Mzk4LTRhNTYtOTZjMy1lOTNlOWFiMzA5YjUiLCJyZXF1ZXN0b3JfYXBwX2Rpc3BsYXluYW1lIjoiT2ZmaWNlIDM2NSBFeGNoYW5nZSBNaWNyb3NlcnZpY2UiLCJzY3AiOiJPd2FBdHRhY2htZW50cy5SZWFkIiwib2lkIjoiMDAwMzdmZmUtOGUxZC04ZTExLTAwMDAtMDAwMDAwMDAwMDAwIiwicHVpZCI6IjAwMDM3RkZFOEUxRDhFMTEiLCJzbXRwIjoiTUNCMTk1MEBsaXZlLmNvbSIsInVwbiI6Ik1DQjE5NTBAbGl2ZS5jb20iLCJ1c2VyY2FsbGJhY2t1c2VyY29udGV4dGlkIjoiMjNhZTUwYzhmMTczNGEyYmI1MmM4YmMwZTI1YzAxMDQiLCJlcGsiOiJ7XCJrdHlcIjpcIlJTQVwiLFwiblwiOlwieE1tcmoxeG9mS2FhSkJpYnkyX09BTTlJSHFPb3dMaGlscFdfOFFjYXRRN3JqbFRGaVR5VThkRjRWSVQwQWRNaWhseDQ3R3lCMnhMcjFid2F5UGdmeGRXSFhmS3JOV0RCamxGR2hUd3FCbEVKRlZhM0xyaGRxbEJKUncxOXMwdl8wdkFsVGFWZVNDVW9ZWHRRYTd3SUJXNHlIckYyZXpJQkxqdTBmNGM2VWhMZkV3enZUMlRfcW81d1N5ODJBNUx6WUUxSXNvTDlwTW05UnhkRlpwYnl3dVdYdjVBM0RNOV92Y1hzaUdndVl5dWQ0dzlkdXowYVk5MnZRX1gyODBPelA0SFVIVm84LWMydXl5X0RMVGV2X3BxbFJfUURKUFVZZ0pJTEI3di12OHVIWEhhUkpydVZlcjJMYjVXWm4zVGxqdlVFYzRSNVp6bWdtVHozek5ia1hRXCIsXCJlXCI6XCJBUUFCXCIsXCJhbGdcIjpcIlJTMjU2XCIsXCJleHBcIjpcIjE3NDMzNzc2NjBcIixcImV4cF9kaWZmXCI6XCI4NjQwMFwiLFwia2lkXCI6XCJZN2xaMFNjZi12bzY4aGJ6Qjk1UVBzZ1BrMklcIn0udnpWY3pmVEJaTEpFUXVWakdRVFFDc2dod01QdG1TeWRxN2hPTzVmTUtLNHlOaGF6emVOKzh4UjNKdUlKUlM4N2x6eXlZUmlXdzZxQkxEYXZoUWZxaGVoeTlPZ2haMEwrRDlqazlrOHB6bW9XdVQ4ZHdGbENUYlFsajUwSEdFZ2tnNEFUVG1XVFZZTHdkYUFmazRYdHNhdTlXMTJjUmRRdER0cU5tZGVHMnFwaGxQUE9uYVNCZEQ1MmV2RkRld2RxOE5HOVQ5YTNOV25GcmRJWUgrVEttakV5SE1DaklEV0dvMitlaFBkdjR4UnVoT1Y0QTRITHVUNVh1VTd6VWZIRndJOXpqMk9jV2Z3RS9IdUFsZTBJemFRRkw3N1E2WDNjOVVOK1hXRXVoMG53YWVMejdMVnhKb0cySDIxRk8rSnFMQWFZaTQ3MWgzOC93MTE1NHNwWUtRPT0iLCJuYmYiOjE3NDMyODgzMDIsImV4cCI6MTc0MzI4ODYwMiwiaXNzIjoiaHR0cHM6Ly9zdWJzdHJhdGUub2ZmaWNlLmNvbS9zdHMvIiwiYXVkIjoiaHR0cHM6Ly9vdXRsb29rLm9mZmljZS5jb20iLCJzc2VjIjoiRTdMNlBobkNkUE1McmtxViJ9.VJPdWxshrY4JXGZSnqfT1Z51GpXU5oumOdn1xqpAu4cWzBBc8iL5ht-vZzHjR0ZC-CmJJbiM6QXNa-jHcUm2oRAkWt5Rk7LWiYu3qTjYNbrrRhZjAcKyaLqOKXqVRk7r9bAiZDE5FTUDZtnZyGMXzk5aMoVGz-Fkx6d3VvtnrAqw-gt1owUpjBQKQk2EgYCrHMgW1UtB-WWi9UrXclxjG1gX__W4L2xBp16xI0G5A5ht2tas7jVjDXqbNMYoyYBAcXpkkyw4nryFTVYQn5XuE3diJWWJJT6KJuVS06P2BGF5K8fgrI4nC8aphjLXg1xfl7crYxEyWKbFMtwKVnbJhA&amp;X-OWA-CANARY=wTQ4Tct8mW8AAAAAAAAAAFDTqGQTb90YdPgBV1PqV5H6uu5jmH9xZ7jTvxEfOXwscDtKvSpC3Qw.&amp;owa=outlook.live.com&amp;scriptVer=20250320055.21&amp;clientId=E22276EEE9B6406B9A370888792F527C&amp;animation=true" loading="lazy" height="749.25">
</p>

<p>
	Suppose my bsp compiler chooses f<sub>1</sub> as the first splitting plane.  Then f<sub>4</sub> will be split into a triangle (f<sub>4a</sub>) and a square (f<sub>4b</sub>).   F<sub>2</sub>, f<sub>3</sub>, f<sub>4b</sub>, f<sub>7 </sub>will be "in".  F<sub>6</sub>, f<sub>5.</sub> f<sub>4</sub><sub>a</sub> will be "out"
</p>

<p>
	This is a bad bsp tree for collision detection using offset surface.  The decomposition of the object into two convexes (a ramp and a block) will result in discontinuities that an avatar may get stuck on.  
</p>

<p>
	<img alt="Image preview" width="999" src="https://attachment.outlook.live.net/owa/MSA%3AMCB1950%40live.com/service.svc/s/GetAttachmentThumbnail?id=AQMkADAwATM3ZmYAZS04ZTFkLThlMTEALTAwAi0wMAoARgAAAxIPvqBy1fhBjRSfhBVrihQHAH5swtUuw8dCplgal2Bu%2FU4AAAIBDAAAAOJk8t44FVpHhWdGpb%2B82e4AB0ikdjgAAAABEgAQAM4jZlr6AIdBnIOcIy%2FsIRc%3D&amp;thumbnailType=2&amp;isc=1&amp;token=eyJhbGciOiJSUzI1NiIsInR5cCI6IkpXVCIsImtpZCI6Ik9PYmM3cE1RQ0tDWFVDTDhMOUpKTnNMSlQyST0iLCJ4NXQiOiJPT2JjN3BNUUNLQ1hVQ0w4TDlKSk5zTEpUMkk9Iiwibm9uY2UiOiJhQkpSMzdYb3VGZFRSM3g4Wnd4ZVVxX2R5MlpZWDV2elBfejhleFdwRzhGQTB6cEdHUGJ1RG9jaGl5ckc0YUc0RktrRlNJZ3FpYldiUk1HSkhPeGQwTXBjbXRsQVZnVzdublBRMmRxMGhVOGctdTlUc3JaY2hnSlNFcURPTjdlS2ZxTTRKM2J0cklNZXJjaFJ6OEtrQUlYR2xLM3ViS2g4d25hYXlwaEdtWnMiLCJpc3Nsb2MiOiJEUzBQUjEyTUI3NzcxIiwic3JzbiI6NjM4Nzg4NDc1NDk3NDk4ODA2fQ.eyJzYXAtdmVyc2lvbiI6IjMxIiwiYXBwaWQiOiJhZjNlYmJiYS1jMjNmLTQ5MmEtYWE5My04MzQyMTY5NmVjNGIiLCJpc3NyaW5nIjoiV1ciLCJhcHBpZGFjciI6IjIiLCJhcHBfZGlzcGxheW5hbWUiOiIiLCJ1dGkiOiJhNjZkOWYwOC1hMTliLTQ5YjctOGRjNy0yNzJkYTljMWQ3NGEiLCJpYXQiOjE3NDMyODk3NTIsInZlciI6IlNUSS5Vc2VyLkNhbGxiYWNrVG9rZW4uVjEiLCJ0aWQiOiI4NGRmOWU3ZmU5ZjY0MGFmYjQzNWFhYWFhYWFhYWFhYSIsInRydXN0ZWRmb3JkZWxlZ2F0aW9uIjoiZmFsc2UiLCJ0b3BvbG9neSI6IntcIlR5cGVcIjpcIk1hY2hpbmVcIixcIlZhbHVlXCI6XCJEUzBQUjEyTUI3NzcxLm5hbXByZDEyLnByb2Qub3V0bG9vay5jb21cIn0iLCJyZXF1ZXN0b3JfYXBwaWQiOiIxNTdjZGZiZi03Mzk4LTRhNTYtOTZjMy1lOTNlOWFiMzA5YjUiLCJyZXF1ZXN0b3JfYXBwX2Rpc3BsYXluYW1lIjoiT2ZmaWNlIDM2NSBFeGNoYW5nZSBNaWNyb3NlcnZpY2UiLCJzY3AiOiJPd2FBdHRhY2htZW50cy5SZWFkIiwib2lkIjoiMDAwMzdmZmUtOGUxZC04ZTExLTAwMDAtMDAwMDAwMDAwMDAwIiwicHVpZCI6IjAwMDM3RkZFOEUxRDhFMTEiLCJzbXRwIjoiTUNCMTk1MEBsaXZlLmNvbSIsInVwbiI6Ik1DQjE5NTBAbGl2ZS5jb20iLCJ1c2VyY2FsbGJhY2t1c2VyY29udGV4dGlkIjoiMjNhZTUwYzhmMTczNGEyYmI1MmM4YmMwZTI1YzAxMDQiLCJlcGsiOiJ7XCJrdHlcIjpcIlJTQVwiLFwiblwiOlwicXpUcXFqMEE0YkJpZGV6Y1dsT0p0d3l2YnFpQnV4WFRmYXNSOVFPVnRqUHhKMmlNb3lnR1gta3lscjdKUEFHQUtaVW9fX2Y1TEFjLXdCMTd1dVVjUUhHT2VYUjd4VERnU0xDT3Bpci1IYUlXQXBXbkF5ZXhzaVc4LXNOMW00T01XcUxMVmhtMmYxdGU4U2FqR2tmdVpPaFRBOTdicEg3TXJ5N1BTdW1NdTU0azhkTWl6U1hzNG1LV2hoelRFZ0FibjgwZlFya2hheUVaazRYakJ4YnlRc3YxXzM0WXoxTGNSQXJmZW1SM1JLSWIxdkdNYWpqY1UwLXBSV3Y3X2MwekxMTElkQ2oxMmd1MXJaZ0FFdk9lRjZQWmFPaDNtaURlSzd2MzNZcXV4UkV2YlJjeHFCM19xVUJBa29Nd2pWV1hPZ0FPdnJRZVpkd2U2UTdTUE5DQVZRXCIsXCJlXCI6XCJBUUFCXCIsXCJhbGdcIjpcIlJTMjU2XCIsXCJleHBcIjpcIjE3NDMzNzk0NjBcIixcImV4cF9kaWZmXCI6XCI4NjQwMFwiLFwia2lkXCI6XCJZN2xaMFNjZi12bzY4aGJ6Qjk1UVBzZ1BrMklcIn0uTzRDSFlCVlhwbUlYMGxVZnVFSzhiUlhWa1RVMk5JNW9QMVRwT283MTdHYjhTaGRyaXhIT2ZFbEM3cDc2SmxyZDNKQ0xWTjN3cWc1QkMybHNDYWc1cXlqSThuZWZsTFBpU1c3WHBZN1BWZjlhYUwydFZyYTgzOXFKN2x4dTJOcUE2dUpLTEg5bmNMa2xjelBkV3ZtS1M1eEJxTS9BTzFHQWw5dU5VWXJxNE9mYWs1WlVlMXQwR3ZMOW9BL2UyNkdMamw1L1ROQ2JZTXNIY2hBamJrOWgzbXd2U29HZk1JRHlGMjd3QlpaeCtoRTRKUktrdFY5QVNHaWh5QXByUWdZdFNGSFp3ODhQTkpIVldTMVY3Sy9YOUg5dWRDaHRlOExqNWxaQVM1ZFh4N1JjM0xpZnNNNldhcGsxeStZZzNRSnoxNHoyYzFpZ0pzOU1neWpHYUFUaHpRPT0iLCJuYmYiOjE3NDMyODk3NTIsImV4cCI6MTc0MzI5MDA1MiwiaXNzIjoiaHR0cHM6Ly9zdWJzdHJhdGUub2ZmaWNlLmNvbS9zdHMvIiwiYXVkIjoiaHR0cHM6Ly9vdXRsb29rLm9mZmljZS5jb20iLCJzc2VjIjoiRTdBM2xud3NjYUZ3NjgvUCJ9.YLbGBZTsCJvzphaOy_t3-TquG5-KJVZN0JG970SXBAl4j08FXeoUAoPggwI33606hYRd5pJ3DDTodUzkmzPr5TkMSWvTFzfKsORNTkZKSXCcLOdnhu5WWqJBRmV39E9xs41fRk5gsTjxfvtFu7s2WJr8BK0qfB5qXvKLSsONbrbpH7AQmYlx2PYeVEX_8GraWJSNfM12tZaQcNG8-XalewOJrn2q7mjROK4nGBQlWWwh0aORLuAtf9Iz-RuOMz-SQfgLB-ImqIuNiz1NsRTuidg-_anpZG863VesGUEvV4WOBnygM4PFbGf8wpvwwTV7PtbIVqgYpPlNhpdcdtO3jA&amp;X-OWA-CANARY=wTQ4Tct8mW8AAAAAAAAAACCM5DYXb90YVd8Rt25zj08-c-EwrnhfHg0No63_qMVLIQk1bhx9rU4.&amp;owa=outlook.live.com&amp;scriptVer=20250320055.21&amp;clientId=E22276EEE9B6406B9A370888792F527C&amp;animation=true" loading="lazy" height="749.25">
</p>

<p>
	If, however, I chose f<sub>6a</sub> as the first splitting plane, I will not have that problem because the ramp-block connection will be part of the same convex.  How do I prevent this (and any generalization of this topology) from being compiled into a bad bsp tree?  
</p>

<p>
	Beveling is not the problem, because you are only supposed to bevel if the angles are acute.  The ramp-block interface is obtuse.  
</p>

<p>
	Thank you.
</p>

<p>
	 
</p>

<p>
	 
</p>
]]></description><guid isPermaLink="false">135688</guid><pubDate>Sat, 29 Mar 2025 23:18:24 +0000</pubDate></item><item><title>I Built A Symbolic AI That Reasons Through Math And Physics Using Grounding Truths, Adaptive Logic, And Dimensional Awareness.</title><link>https://www.scienceforums.net/topic/135689-i-built-a-symbolic-ai-that-reasons-through-math-and-physics-using-grounding-truths-adaptive-logic-and-dimensional-awareness/</link><description><![CDATA[<p>
	Over the last few months, I’ve developed a symbolic AI system called <strong>MathAI</strong> — not just a math calculator, but a dynamic reasoning engine designed to simulate how real physical problems behave under mathematical structure. This isn’t a neural network, a typical CAS (Computer Algebra System), or a rigid symbolic simplifier — it’s a hybrid between mathematical theory, physics modeling, and logical verification. (This might sound simple. Just keep reading.)
</p>

<h3>
	<span class="ipsEmoji">🔍</span> What Is It?
</h3>

<p>
	<strong>MathAI</strong> takes symbolic math inputs, evaluates them using <code>sympy</code>, and augments that logic with a few very powerful features:
</p>

<h3>
	<span class="ipsEmoji">🧱</span> Grounding Truths
</h3>

<p>
	MathAI has a core idea: it learns from <strong>grounding truths</strong> — equations that are known to be dimensionally and symbolically valid. These include classical physics equations (like kinetic energy, work with angle, Coulomb’s law, etc.) and mathematical identities from trigonometry.
</p>

<p>
	Once an equation is solved and recognized as consistent (or verified manually), it’s <strong>promoted</strong> to a “grounding truth,” meaning it can be used to verify future equations by structure or result similarity.
</p>

<h3>
	<span class="ipsEmoji">🧪</span> Partial Truths &amp; Learning
</h3>

<p>
	When MathAI evaluates an equation that doesn't match a known truth, but still <strong>produces a valid result</strong>, it stores it as a <strong>partial truth</strong>. These are reviewed and can be promoted to grounding truths — allowing the system to grow over time. This mimics a human learner testing what "seems right" until enough confidence is built.
</p>

<h3>
	<span class="ipsEmoji">⚖️</span> Dimensional Reasoning (Partial Unit Balance)
</h3>

<p>
	One of the script’s standout features is that it checks <strong>symbolic dimensional consistency</strong>. Using a lookup table of physical units, it compares the units involved in each term of an equation. If it detects that values of incompatible dimensions being added or equated, it raises a warning — something even many modern CAS tools don’t attempt symbolically.
</p>

<h3>
	<span class="ipsEmoji">🔁</span> Adaptive Ratio Logic
</h3>

<p>
	MathAI uses an <strong>adaptive ratio system</strong>. It doesn’t just take two variables and divide them blindly — instead, it checks their relative magnitude. If the first value is greater, it divides; if not, it multiplies. This feature is useful when modeling real-world systems where relationships change based on scale.
</p>

<h3>
	<span class="ipsEmoji">🤔</span> Why Does This Matter?
</h3>

<p>
	Traditional symbolic engines process math strictly. MathAI tries to <strong>reason</strong> about math — not just compute it. It asks:
</p>

<ul>
	<li>
		<p>
			<em>Is this equation built out of truths I already know?</em>
		</p>
	</li>
	<li>
		<p>
			<em>Do the units make sense?</em>
		</p>
	</li>
	<li>
		<p>
			<em>Is there a deeper pattern here worth remembering?</em>
		</p>
	</li>
</ul>

<p>
	I believe symbolic tools should <strong>reflect and adapt</strong> — not just return numbers.
</p>

<h3>
	<span class="ipsEmoji">🧪</span> Call for Collaboration
</h3>

<p>
	If you’re a:
</p>

<ul>
	<li>
		<p>
			<strong>Scientist</strong> working with symbolic systems
		</p>
	</li>
	<li>
		<p>
			<strong>Educator</strong> building teaching tools for physics or math
		</p>
	</li>
	<li>
		<p>
			<strong>Researcher</strong> modeling physical laws or quantum interactions
		</p>
	</li>
	<li>
		<p>
			<strong>Developer</strong> looking to integrate symbolic AI
		</p>
	</li>
</ul>

<p>
	…then I’d love to connect.
</p>

<p>
	Whether you're working on difficult math modeling, scientific calculators, physics simulators, or something completely new — I think this tool could be incredibly useful.
</p>

<p>
	Feel free to reach out, ask technical questions, or challenge the engine with hard problems. I'm always improving it and I plan to share it as widely as I can but I have no real means right now. 
</p>

<p>
	Here's something to peak interest. Take into consideration that my code will only utilize a single core of a processor and works on my Ryzen 7 7800 with sub one second results. (Soon maybe GPUs will have support, but I need data sets with thousands of mathematical problems to run before its even relatively needed.)
</p>

<p>
	<img class="ipsImage ipsImage_thumbnailed" data-fileid="30723" width="557" alt="image.png.469483a3a61e58a14cbe548c011de0a9.png" src="https://www.scienceforums.net/uploads/monthly_2025_03/image.png.469483a3a61e58a14cbe548c011de0a9.png" loading="lazy" height="356.48">
</p>

<p>
	<img class="ipsImage ipsImage_thumbnailed" data-fileid="30722" width="765" alt="image.png.f21167049feaf0638ae6ac23e0d200a4.png" src="https://www.scienceforums.net/uploads/monthly_2025_03/image.png.f21167049feaf0638ae6ac23e0d200a4.png" loading="lazy" height="634.95">
</p>

<p>
	The picture below has a scrollable 1503 decimal digits. Ran on my Ryzen.
</p>

<p>
	<img class="ipsImage ipsImage_thumbnailed" data-fileid="30724" width="670" alt="image.png.139c14977d43870e1fbd046c500f3077.png" src="https://www.scienceforums.net/uploads/monthly_2025_03/image.png.139c14977d43870e1fbd046c500f3077.png" loading="lazy" height="643.2">
</p>

<p>
	<a class="ipsAttachLink ipsAttachLink_image" href="https://www.scienceforums.net/uploads/monthly_2025_03/image.png.30cf9ed509b87a2cb17074fd9742d597.png" data-fileid="30725" data-fileext="png" rel=""><img class="ipsImage ipsImage_thumbnailed" data-fileid="30725" width="518" alt="image.thumb.png.0b47bed546b4b996c8de08cba856f3a8.png" src="https://www.scienceforums.net/uploads/monthly_2025_03/image.thumb.png.0b47bed546b4b996c8de08cba856f3a8.png" loading="lazy" height="745.92"></a>
</p>

<p>
	 
</p>

<p>
	 
</p>
<p>
	If anyone has a math problem I can attempt to solve it! Just input it as comment.
</p>
<p>
	I can also add almost every field of math! I can even invent a MathAI that works on specific but large areas of math like a version for medical sciences, or one for astronomy perfectly optimized by only working the required math.
</p>
<p>
	It's even made to be able to function areas of math which are "bleeding edge", I plan to add more than a derivative, but a whole system that will allow creation of your own symbols as this is a closed application it will evolve to you!
</p>
<p>
	One more post to get 5. So lets say you want to find a specific value for something seemingly infinite, consider what infinite even means, it means "indefinite" or "forever" but that is a rare function in reality, <strong><em>take a wide perspective and consider what positive and negative means</em></strong>. Positives indicate things like, kinetics, volume, mass, or anything physical at that point. SO how can something be infinite or indefinite? My perspective is that it is a simple factor of functions, since we know decay happens then something is removing values, so look into division and diffusion, it produces infinite wells of value depreciation, so then what can be inferred about finding infinite values? IF its positive, its not infinite, if its function is to decay or diffuse then yes it can be indefinite. This might be controversial because of how many things we think are infinite, but I think some values are a simply LONG.
</p>
<p>
	Okay I gotta add this. Stars are BIG, imagine how much energy is conducted inside of a star! With all of that energy then light <strong><em>could be a reflection of the complexity in the conduction of plasma. </em></strong>Now calculate that.... Just kidding, as you can imagine a number which has as much complexity that is reflected in a star could be a value so loooong its unrealistically long. Point is, light can be narrowed to specific values based on the complexity of the waveform being produced by the particle shining because that particle has mass and is in combustion which is all align with positive function. At least that's what I believe.
</p>
]]></description><guid isPermaLink="false">135689</guid><pubDate>Sun, 30 Mar 2025 03:50:27 +0000</pubDate></item><item><title>Generative AI could lead to fully AGI</title><link>https://www.scienceforums.net/topic/135540-generative-ai-could-lead-to-fully-agi/</link><description><![CDATA[<p>
	I believe that generative AI could eventually lead to fully self-developing agi, any thoughts?
</p>
]]></description><guid isPermaLink="false">135540</guid><pubDate>Mon, 24 Feb 2025 02:29:07 +0000</pubDate></item><item><title>Does anyone use ChatGPT or another AI ?</title><link>https://www.scienceforums.net/topic/134787-does-anyone-use-chatgpt-or-another-ai/</link><description><![CDATA[<p>
	After I discovered ChatGPT, I asked it a lot of questions, maybe 100, and it was interesting to see the answers, often in great detail, and most of it seems true.  It's not perfect but can answer any simple question that has a generally accepted answer.  Recently, ChatGPT stopped answering my questions.  I know it cost to have unlimited access.  I had a limit to how many questions I could ask in one day.  But now days have gone by and ChatGPT continues to ignore me.  Anyone know about ChatGPT?
</p>
]]></description><guid isPermaLink="false">134787</guid><pubDate>Tue, 15 Oct 2024 17:02:40 +0000</pubDate></item><item><title>Combining BSP/GJKEPA/PGSLCP algorithms into a Game Loop</title><link>https://www.scienceforums.net/topic/135411-combining-bspgjkepapgslcp-algorithms-into-a-game-loop/</link><description><![CDATA[<p>
	 I want to do the following;
</p>

<ul>
	<li>
		BSP offset as described by Melax in his paper for environment collisions.
	</li>
	<li>
		GJKEPA, or SAT for object on object collisions. 
	</li>
	<li>
		Use collision response formula for bouncing objects. 
	</li>
	<li>
		Use PGSLCP solver for sliding rolling objects. 
	</li>
</ul>

<p>
	PGSLCP solver allows small inter-penetrations, which are corrected using Baumgarte stabilization.  This means I don't have to subdivide time intervals every time a collision occurs.  This works well with GJKEPA and separating axis, but BSP offset returns the exact time and location of the first collision.  BSP offset requires subdivision of the time interval, because if the object falls through the floor an infinitesimal amount the contact will not register on the next frame. My question; is BSP offset incompatible with PGSLCP solver? 
</p>

<p>
	 
</p>
]]></description><guid isPermaLink="false">135411</guid><pubDate>Wed, 29 Jan 2025 19:30:23 +0000</pubDate></item><item><title>Disappearing Network Attached Storage.</title><link>https://www.scienceforums.net/topic/134890-disappearing-network-attached-storage/</link><description><![CDATA[<p>
	I have a Netgear NAS unit with 4 large drives in it as my backup/offline storage.
</p>

<p>
	This has performed fine for several years now.
</p>

<p>
	However just recently I can't access it.
</p>

<p>
	Most of the references have disappeared in Windows File Explorer and I can't access the one that is left.
</p>

<p>
	 
</p>

<p>
	Any idea please ?
</p>
]]></description><guid isPermaLink="false">134890</guid><pubDate>Sat, 02 Nov 2024 20:25:20 +0000</pubDate></item><item><title>P vs NP</title><link>https://www.scienceforums.net/topic/134838-p-vs-np/</link><description><![CDATA[<p>
	<span style="background-color:#ffffff;color:#222222;font-size:small;">In my recent work, I have developed a new perspective on the Boolean satisfiability problem (SAT), focusing particularly on formulas in Conjunctive Normal Form (CNF). This exploration introduces a classification of SAT subproblems based on the nature of the literals within the clauses, and a novel concept called saturation as a measure of contradiction. Below, I will provide an overview of this approach and highlight its key implications for SAT complexity and algorithmic design.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">1. Classification of Clauses</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">I categorize the clauses of a CNF formula into three distinct types:</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">P: Clauses containing only positive literals.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">N: Clauses containing only negative literals.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">M: Clauses that include at least one positive and one negative literal.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">Each clause in a CNF formula fits into exactly one of these categories, leading to seven potential subproblem types in SAT:</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">P (only positive clauses)</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">N (only negative clauses)</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">M (mixed clauses)</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">M ∧ N</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">M ∧ P</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">P ∧ N</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">M ∧ P ∧ N (the most general case)</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">2. Triviality of Subproblems</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">One of the significant findings is that the subproblems P, N, M ( it is clear if you put the formula in an algebric/logic form), M AND N, M AND P, P AND N(this case is  satisfiable only if there is no direct contraddiction, s.a. Xi and notXi, due to the Saturation concept) are trivially satisfiable. For example:</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">In subproblem P, assigning all variables the value 1 satisfies every clause.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">Similarly, for N, assigning 0 satisfies every clause.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">M is also trivial, since any assignment of 0 or 1 satisfies its mixed structure.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">M AND N assigning all variables the value 0 satisfies every clause.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">M AND P assigning all variables the value 1 satisfies every clause.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">This triviality offers insights into simpler SAT instances, but the combination of these subproblems (especially M ∧ P ∧ N) becomes much more challenging.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">3. The Concept of Saturation</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">In this work, I introduce the idea of saturation, which is essentially a condition of over-determination in SAT. A formula is said to be "saturated" when it includes all possible variations (complementary forms) of a clause. This concept leads to a useful theorem:</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">If a formula contains all clauses from the complement set of any of its clauses, the formula is unsatisfiable.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">This result stems from the fact that if every possible assignment is blocked by at least one clause, there is no way to satisfy the entire formula. Saturation thus provides a direct way to detect unsatisfiability in some cases.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">4. A Global Saturation Conjecture</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">One of the open questions in this research is whether there exists a critical saturation threshold beyond which a formula becomes unsatisfiable. I propose the following conjecture:</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">There exists a critical saturation degree</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">𝛿</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">𝑐</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">δ</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">c</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">  such that, if a formula has a saturation degree</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">𝛿</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">&gt;</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">𝛿</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">𝑐</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">δ&gt;δ</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">c</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;"> , it becomes unsatisfiable.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">Understanding and quantifying this threshold could lead to new tools for analyzing the complexity of SAT instances and potentially developing more efficient algorithms for detecting unsatisfiability.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">Right now I'm exploring another way using generating function , to count instances of the varaibles that satisfies the formula.</span><br style="background-color:#ffffff;color:#222222;font-size:small;" />
	<span style="background-color:#ffffff;color:#222222;font-size:small;">I'll be vary grateful if you could verify or help me to finish this study :)</span>
</p>
]]></description><guid isPermaLink="false">134838</guid><pubDate>Tue, 22 Oct 2024 09:51:18 +0000</pubDate></item><item><title>What is the idle time of each server in the three server system?</title><link>https://www.scienceforums.net/topic/134825-what-is-the-idle-time-of-each-server-in-the-three-server-system/</link><description><![CDATA[<div>
	<div>
		<h5>
			 
		</h5>

		<div>
			<em>Question:</em>
		</div>

		<div>
			Two customers move about among three servers. Upon completion of service at a server, the customer leaves that server and enters service at whichever of the other two servers is free. If the service times at server i are exponential with rate [latex]\mu_i, i= 1,2,3 [/latex], What proportion of time is server i idle?
		</div>

		<div>
			 
		</div>

		<div>
			<strong>My solution:</strong>
		</div>

		<div>
			 
		</div>

		<div>
			<div>
				<div>
					<div>
						<p>
							To determine the proportion of time each server is idle in this system, we can use the concept of <strong>Markov chains</strong> and <strong>queueing theory</strong>. Here’s a step-by-step outline of the approach:
						</p>

						<ol>
							<li>
								<p>
									<strong>Define the States</strong>:
								</p>

								<ul>
									<li>
										Let [latex]( S_i ) [/latex]represent the state where server <em>( i )</em> is idle.
									</li>
									<li>
										Since there are three servers, we have states [latex]( S_1, S_2, )[/latex] and [latex]( S_3 ).[/latex]
									</li>
								</ul>
							</li>
							<li>
								<p>
									<strong>Transition Rates</strong>:
								</p>

								<ul>
									<li>
										The service times are exponential with rates [latex]( \mu_1, \mu_2, ) and ( \mu_3 ).[/latex]
									</li>
									<li>
										When a customer finishes service at server <em>( i )</em>, they move to one of the other two servers. The transition rate from server <em>( i )</em> to server <em>( j ) </em>is [latex]( \mu_i ).[/latex]
									</li>
								</ul>
							</li>
							<li>
								<p>
									<strong>Balance Equations</strong>:
								</p>

								<ul>
									<li>
										For each server ( i ), the proportion of time it is idle, denoted by ( P<sub>i</sub>), can be found by solving the balance equations.
									</li>
									<li>
										The balance equations for the idle times are:[latex] [ P_1 (\mu_2 + \mu_3) = \mu_2 P_2 + \mu_3 P_3 ] [ P_2 (\mu_1 + \mu_3) = \mu_1 P_1 + \mu_3 P_3 ] [ P_3 (\mu_1 + \mu_2) = \mu_1 P_1 + \mu_2 P_2 ][/latex]
									</li>
								</ul>
							</li>
							<li>
								<p>
									<strong>Normalization Condition</strong>:
								</p>

								<ul>
									<li>
										The sum of the proportions must equal 1: [latex][ P_1 + P_2 + P_3 = 1 ][/latex]
									</li>
								</ul>
							</li>
							<li>
								<p>
									<strong>Solve the System of Equations</strong>:
								</p>

								<ul>
									<li>
										Solve the above system of linear equations to find [latex]( P_1, P_2, ) and ( P_3 ).[/latex]
									</li>
								</ul>
							</li>
						</ol>

						<p>
							Let’s solve these equations step-by-step:
						</p>

						<ol>
							<li>
								<p>
									From the balance equations:[latex] [ P_1 (\mu_2 + \mu_3) = \mu_2 P_2 + \mu_3 P_3 ] [ P_2 (\mu_1 + \mu_3) = \mu_1 P_1 + \mu_3 P_3 ] [ P_3 (\mu_1 + \mu_2) = \mu_1 P_1 + \mu_2 P_2 ][/latex]
								</p>
							</li>
							<li>
								<p>
									Using the normalization condition: <strong>[ P<sub>1</sub> + P<sub>2</sub> + P<sub>3</sub> = 1 ]</strong>
								</p>
							</li>
						</ol>

						<p>
							By solving these equations, you can find the exact proportions <strong>( P<sub>1</sub>, P<sub>2</sub>, ) </strong>and <strong>( P<sub>3</sub> ). </strong>
						</p>
					</div>
				</div>
			</div>
		</div>
	</div>
</div>
]]></description><guid isPermaLink="false">134825</guid><pubDate>Sun, 20 Oct 2024 15:04:34 +0000</pubDate></item></channel></rss>
