mathstodon.xyz is one of the many independent Mastodon servers you can use to participate in the fediverse.
A Mastodon instance for maths people. We have LaTeX rendering in the web interface!

Server stats:

2.9K
active users

#IdeaProcessor

0 posts0 participants0 posts today
Jon Awbrey<p>Survey of Theme One Program<br />• <a href="https://inquiryintoinquiry.com/2023/03/30/survey-of-theme-one-program-5/" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">inquiryintoinquiry.com/2023/03</span><span class="invisible">/30/survey-of-theme-one-program-5/</span></a></p><p>This is a Survey of resources for the Theme One Program I worked on all through the 1980s. The aim was to develop fundamental algorithms and data structures for integrating empirical learning with logical reasoning. I had earlier developed separate programs for basic components of those tasks, namely, 2-level formal language learning and propositional constraint satisfaction, the latter using an extension of C.S. Peirce&#39;s logical graphs as a syntax for propositional logic. Thus arose the question of how well it might be possible to get “empiricist” and “rationalist” modes of operation to cooperate. The long-term vision is the design and implementation of an Automated Research Tool able to double as a platform for Inquiry Driven Education.</p><p>Please follow the above link for the full set of resources. An initial sample is linked below.</p><p>Wiki Hub —</p><p>Theme One Program • Overview<br />• <a href="https://oeis.org/wiki/Theme_One_Program_%E2%80%A2_Overview" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">oeis.org/wiki/Theme_One_Progra</span><span class="invisible">m_%E2%80%A2_Overview</span></a></p><p>Documentation —</p><p>Theme One Program • Pascal Source Code<br />• <a href="https://www.academia.edu/5210987/Theme_One_Program_Pascal_Source_Code" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://www.</span><span class="ellipsis">academia.edu/5210987/Theme_One</span><span class="invisible">_Program_Pascal_Source_Code</span></a></p><p>Theme One Program • User Guide<br />• <a href="https://www.academia.edu/5211369/Theme_One_Program_User_Guide" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://www.</span><span class="ellipsis">academia.edu/5211369/Theme_One</span><span class="invisible">_Program_User_Guide</span></a></p><p>Theme One Program • Exposition<br />• <a href="https://oeis.org/wiki/Theme_One_Program_%E2%80%A2_Exposition" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">oeis.org/wiki/Theme_One_Progra</span><span class="invisible">m_%E2%80%A2_Exposition</span></a></p><p>Applications —</p><p>Applications of a Propositional Calculator • Constraint Satisfaction Problems<br />• <a href="https://www.academia.edu/4727842/Applications_of_a_Propositional_Calculator_Constraint_Satisfaction_Problems" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://www.</span><span class="ellipsis">academia.edu/4727842/Applicati</span><span class="invisible">ons_of_a_Propositional_Calculator_Constraint_Satisfaction_Problems</span></a></p><p>Exploratory Qualitative Analysis of Sequential Observation Data<br />• <a href="https://oeis.org/wiki/User:Jon_Awbrey/Exploratory_Qualitative_Analysis_of_Sequential_Observation_Data" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">oeis.org/wiki/User:Jon_Awbrey/</span><span class="invisible">Exploratory_Qualitative_Analysis_of_Sequential_Observation_Data</span></a></p><p>References —</p><p>An Architecture for Inquiry • Building Computer Platforms for Discovery<br />• <a href="https://www.academia.edu/1270327/An_Architecture_for_Inquiry_Building_Computer_Platforms_for_Discovery" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://www.</span><span class="ellipsis">academia.edu/1270327/An_Archit</span><span class="invisible">ecture_for_Inquiry_Building_Computer_Platforms_for_Discovery</span></a></p><p>Exploring Research Data Interactively • Theme One : A Program of Inquiry<br />• <a href="https://www.academia.edu/1272839/Exploring_Research_Data_Interactively._Theme_One_A_Program_of_Inquiry" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://www.</span><span class="ellipsis">academia.edu/1272839/Exploring</span><span class="invisible">_Research_Data_Interactively._Theme_One_A_Program_of_Inquiry</span></a></p><p><a href="https://mathstodon.xyz/tags/Peirce" class="mention hashtag" rel="tag">#<span>Peirce</span></a> <a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="tag">#<span>Logic</span></a> <a href="https://mathstodon.xyz/tags/LogicalGraphs" class="mention hashtag" rel="tag">#<span>LogicalGraphs</span></a> <a href="https://mathstodon.xyz/tags/ThemeOneProgram" class="mention hashtag" rel="tag">#<span>ThemeOneProgram</span></a> <a href="https://mathstodon.xyz/tags/IdeaProcessor" class="mention hashtag" rel="tag">#<span>IdeaProcessor</span></a><br /><a href="https://mathstodon.xyz/tags/BooleanSatisfiability" class="mention hashtag" rel="tag">#<span>BooleanSatisfiability</span></a> <a href="https://mathstodon.xyz/tags/CactusLanguage" class="mention hashtag" rel="tag">#<span>CactusLanguage</span></a> <a href="https://mathstodon.xyz/tags/DeclarativeProgramming" class="mention hashtag" rel="tag">#<span>DeclarativeProgramming</span></a></p>
Jon Awbrey<p>Theme One Program • Discussion 10<br />• <a href="https://inquiryintoinquiry.com/2023/04/17/theme-one-program-discussion-10/" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">inquiryintoinquiry.com/2023/04</span><span class="invisible">/17/theme-one-program-discussion-10/</span></a></p><p>Re: Seamus Bradley<br />• <a href="https://web.archive.org/web/20230422200222/https://mathstodon.xyz/@Scmbradley/110198310724722597" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">web.archive.org/web/2023042220</span><span class="invisible">0222/https://mathstodon.xyz/@Scmbradley/110198310724722597</span></a></p><p>❝I thought of a programming language where every function can only return one type: the return type. The return type is just a wrapper around a struct that contains the actual return value, but also a reference to the called function and arguments, and possibly an error code.❞</p><p>My flashback —</p><p>Way back in the last millennium I started work on a programming style I called an “idea processor”, where an “idea” is a pointer to a “form” and a form is a minimal type of record containing 1 character, 1 number, and 4 more ideas.</p><p>I implemented a functional style where all the main functions are transformations of one or more ideas to a return idea. The principal data type is an “idea-form flag” which serves a role analogous to a “cons cell” in <a href="https://mathstodon.xyz/tags/Lisp" class="mention hashtag" rel="tag">#<span>Lisp</span></a>.</p><p>Here&#39;s one entry point —</p><p>Theme One Program • Exposition 1<br />• <a href="https://inquiryintoinquiry.com/2022/06/15/theme-one-program-exposition-1-2/" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">inquiryintoinquiry.com/2022/06</span><span class="invisible">/15/theme-one-program-exposition-1-2/</span></a></p><p><a href="https://mathstodon.xyz/tags/Peirce" class="mention hashtag" rel="tag">#<span>Peirce</span></a> <a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="tag">#<span>Logic</span></a> <a href="https://mathstodon.xyz/tags/LogicalGraphs" class="mention hashtag" rel="tag">#<span>LogicalGraphs</span></a> <a href="https://mathstodon.xyz/tags/ThemeOneProgram" class="mention hashtag" rel="tag">#<span>ThemeOneProgram</span></a> <a href="https://mathstodon.xyz/tags/IdeaProcessor" class="mention hashtag" rel="tag">#<span>IdeaProcessor</span></a><br /><a href="https://mathstodon.xyz/tags/CactusLanguage" class="mention hashtag" rel="tag">#<span>CactusLanguage</span></a> <a href="https://mathstodon.xyz/tags/DeclarativeProgram" class="mention hashtag" rel="tag">#<span>DeclarativeProgram</span></a> <a href="https://mathstodon.xyz/tags/FunctionalProgramming" class="mention hashtag" rel="tag">#<span>FunctionalProgramming</span></a></p>
Jon Awbrey<p><span class="h-card" translate="no"><a href="https://mathstodon.xyz/@Scmbradley" class="u-url mention">@<span>Scmbradley</span></a></span></p><p>Way back in the last millennium I started work on a programming style I called an <a href="https://mathstodon.xyz/tags/IdeaProcessor" class="mention hashtag" rel="tag">#<span>IdeaProcessor</span></a>, where an “idea” is a pointer to a “form” and a form is a minimal type of record containing 1 character, 1 number, and 4 more ideas.</p><p>I implemented a functional style where all the main functions are transformations of one or more ideas into a return idea. </p><p>The principal data type is an “idea-form flag” that serves a role analogous to a <a href="https://mathstodon.xyz/tags/ConsCell" class="mention hashtag" rel="tag">#<span>ConsCell</span></a> in <a href="https://mathstodon.xyz/tags/Lisp" class="mention hashtag" rel="tag">#<span>Lisp</span></a>. </p><p>Here&#39;s one entry point —</p><p>Theme One Program • Exposition 1<br />• <a href="https://inquiryintoinquiry.com/2022/06/15/theme-one-program-exposition-1-2/" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">inquiryintoinquiry.com/2022/06</span><span class="invisible">/15/theme-one-program-exposition-1-2/</span></a></p>