Sigmoid Social

Jon AwbreyCactus Language • Overview 3.2 • <a href="https://inquiryintoinquiry.com/2025/03/07/cactus-language-overview-3/" rel="nofollow noopener" translate="no" target="_blank">https://inquiryintoinquiry.com/2025/03/07/cactus-language-overview-3/</a>Given a body of conceivable propositions we need a way to follow the threads of their indications from their object domain to their values for the mind and a way to follow those same threads back again. Moreover, we need to implement both ways of proceeding in computational form. Thus we need programs for tracing the clues sentences provide from the universe of their objects to the signs of their values and, in turn, from signs to objects. Ultimately, we need to render propositions so functional as indicators of sets and so essential for examining the equality of sets as to give a rule for the practical conceivability of sets. Tackling that task requires us to introduce a number of new definitions and a collection of additional notational devices, to which we now turn.Resources —Cactus Language • Overview • <a href="https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Overview" rel="nofollow noopener" translate="no" target="_blank">https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Overview</a>Survey of Animated Logical Graphs • <a href="https://inquiryintoinquiry.com/2024/03/18/survey-of-animated-logical-graphs-7/" rel="nofollow noopener" translate="no" target="_blank">https://inquiryintoinquiry.com/2024/03/18/survey-of-animated-logical-graphs-7/</a>Survey of Theme One Program • <a href="https://inquiryintoinquiry.com/2024/02/26/survey-of-theme-one-program-6/" rel="nofollow noopener" translate="no" target="_blank">https://inquiryintoinquiry.com/2024/02/26/survey-of-theme-one-program-6/</a><a href="https://mathstodon.xyz/tags/Peirce" class="mention hashtag" rel="nofollow noopener" target="_blank">#Peirce</a> <a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="nofollow noopener" target="_blank">#Logic</a> <a href="https://mathstodon.xyz/tags/Semiotics" class="mention hashtag" rel="nofollow noopener" target="_blank">#Semiotics</a> <a href="https://mathstodon.xyz/tags/LogicalGraphs" class="mention hashtag" rel="nofollow noopener" target="_blank">#LogicalGraphs</a> <a href="https://mathstodon.xyz/tags/DifferentialLogic" class="mention hashtag" rel="nofollow noopener" target="_blank">#DifferentialLogic</a> <a href="https://mathstodon.xyz/tags/AutomataTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#AutomataTheory</a> <a href="https://mathstodon.xyz/tags/FormalLanguages" class="mention hashtag" rel="nofollow noopener" target="_blank">#FormalLanguages</a> <a href="https://mathstodon.xyz/tags/FormalGrammars" class="mention hashtag" rel="nofollow noopener" target="_blank">#FormalGrammars</a> <a href="https://mathstodon.xyz/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#GraphTheory</a>

Jon AwbreyCactus Language • Overview 3.1 • <a href="https://inquiryintoinquiry.com/2025/03/07/cactus-language-overview-3/" rel="nofollow noopener" translate="no" target="_blank">https://inquiryintoinquiry.com/2025/03/07/cactus-language-overview-3/</a>In the development of Cactus Language to date the following two species of graphs have been instrumental.• Painted And Rooted Cacti (PARCAI). • Painted And Rooted Conifers (PARCOI).It suffices to begin with the first class of data structures, developing their properties and uses in full, leaving discussion of the latter class to a part of the project where their distinctive features are key to developments at that stage. Partly because the two species are so closely related and partly for the sake of brevity, we'll always use the genus name “PARC” to denote the corresponding cacti.To provide a computational middle ground between sentences seen as syntactic strings and propositions seen as indicator functions the language designer must not only supply a medium for the expression of propositions but also link the assertion of sentences to a means for inverting the indicator functions, that is, for computing the “fibers” or “inverse images” of the propositions.<a href="https://mathstodon.xyz/tags/Peirce" class="mention hashtag" rel="nofollow noopener" target="_blank">#Peirce</a> <a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="nofollow noopener" target="_blank">#Logic</a> <a href="https://mathstodon.xyz/tags/Semiotics" class="mention hashtag" rel="nofollow noopener" target="_blank">#Semiotics</a> <a href="https://mathstodon.xyz/tags/LogicalGraphs" class="mention hashtag" rel="nofollow noopener" target="_blank">#LogicalGraphs</a> <a href="https://mathstodon.xyz/tags/DifferentialLogic" class="mention hashtag" rel="nofollow noopener" target="_blank">#DifferentialLogic</a> <a href="https://mathstodon.xyz/tags/AutomataTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#AutomataTheory</a> <a href="https://mathstodon.xyz/tags/FormalLanguages" class="mention hashtag" rel="nofollow noopener" target="_blank">#FormalLanguages</a> <a href="https://mathstodon.xyz/tags/FormalGrammars" class="mention hashtag" rel="nofollow noopener" target="_blank">#FormalGrammars</a> <a href="https://mathstodon.xyz/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#GraphTheory</a>

Jon AwbreyCactus Language • Overview 2 • <a href="https://inquiryintoinquiry.com/2025/03/06/cactus-language-overview-2/" rel="nofollow noopener" translate="no" target="_blank">https://inquiryintoinquiry.com/2025/03/06/cactus-language-overview-2/</a>In order to facilitate the use of propositions as indicator functions it helps to acquire a flexible notation for referring to propositions in that light, for interpreting sentences in a corresponding role, and for negotiating the requirements of mutual sense between the two domains. If none of the formalisms readily available or in common use meet all the design requirements coming to mind then it is necessary to contemplate the design of a new language especially tailored to the purpose.In the present application, there is a pressing need to devise a general calculus for composing propositions, computing their values on particular arguments, and inverting their indications to arrive at the sets of things in the universe which are indicated by them. For computational purposes it is convenient to have a middle ground or an intermediate language for negotiating between the “koine” of sentences regarded as strings of literal characters and the realm of propositions regarded as objects of logical value, even if that makes it necessary to introduce an artificial medium of exchange between the two domains.If the necessary computations are to be carried out in an organized fashion, and ultimately or partially by familiar classes of machines, then the strings expressing logical propositions are likely to find themselves parsed into tree‑like data structures at some stage of the game. As far as their abstract structures as graphs are concerned, there are several species of graph‑theoretic data structures fitting the task in a reasonably effective and efficient way.<a href="https://mathstodon.xyz/tags/Peirce" class="mention hashtag" rel="nofollow noopener" target="_blank">#Peirce</a> <a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="nofollow noopener" target="_blank">#Logic</a> <a href="https://mathstodon.xyz/tags/Semiotics" class="mention hashtag" rel="nofollow noopener" target="_blank">#Semiotics</a> <a href="https://mathstodon.xyz/tags/LogicalGraphs" class="mention hashtag" rel="nofollow noopener" target="_blank">#LogicalGraphs</a> <a href="https://mathstodon.xyz/tags/DifferentialLogic" class="mention hashtag" rel="nofollow noopener" target="_blank">#DifferentialLogic</a> <a href="https://mathstodon.xyz/tags/FormalLanguages" class="mention hashtag" rel="nofollow noopener" target="_blank">#FormalLanguages</a>

Jon AwbreyCactus Language • Overview 1.2 • <a href="https://inquiryintoinquiry.com/2025/03/01/cactus-language-overview-1/" rel="nofollow noopener" translate="no" target="_blank">https://inquiryintoinquiry.com/2025/03/01/cactus-language-overview-1/</a>Resource —For readers interested and intrepid enough to read ahead, here’s an outline of my work in progress on the OEIS Wiki, which I’ll be revising and serializing to my Inquiry blog.Part 1 • <a href="https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_1" rel="nofollow noopener" translate="no" target="_blank">https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_1</a>Cactus Language • Syntax • <a href="https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_1#Syntax" rel="nofollow noopener" translate="no" target="_blank">https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_1#Syntax</a>Part 2 • <a href="https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_2" rel="nofollow noopener" translate="no" target="_blank">https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_2</a>Generalities About Formal Grammars • <a href="https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_2#Generalities" rel="nofollow noopener" translate="no" target="_blank">https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_2#Generalities</a>Part 3 • <a href="https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_3" rel="nofollow noopener" translate="no" target="_blank">https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_3</a>Cactus Language • Stylistics • <a href="https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_3#Stylistics" rel="nofollow noopener" translate="no" target="_blank">https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_3#Stylistics</a>Cactus Language • Mechanics • <a href="https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_3#Mechanics" rel="nofollow noopener" translate="no" target="_blank">https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_3#Mechanics</a>Cactus Language • Semantics • <a href="https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_3#Semantics" rel="nofollow noopener" translate="no" target="_blank">https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_3#Semantics</a>Stretching Exercises • <a href="https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_3#Stretching_Exercises" rel="nofollow noopener" translate="no" target="_blank">https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Part_3#Stretching_Exercises</a>References • <a href="https://oeis.org/wiki/Cactus_Language_%E2%80%A2_References" rel="nofollow noopener" translate="no" target="_blank">https://oeis.org/wiki/Cactus_Language_%E2%80%A2_References</a>Document History • <a href="https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Document_History" rel="nofollow noopener" translate="no" target="_blank">https://oeis.org/wiki/Cactus_Language_%E2%80%A2_Document_History</a><a href="https://mathstodon.xyz/tags/Peirce" class="mention hashtag" rel="nofollow noopener" target="_blank">#Peirce</a> <a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="nofollow noopener" target="_blank">#Logic</a> <a href="https://mathstodon.xyz/tags/Semiotics" class="mention hashtag" rel="nofollow noopener" target="_blank">#Semiotics</a> <a href="https://mathstodon.xyz/tags/LogicalGraphs" class="mention hashtag" rel="nofollow noopener" target="_blank">#LogicalGraphs</a> <a href="https://mathstodon.xyz/tags/DifferentialLogic" class="mention hashtag" rel="nofollow noopener" target="_blank">#DifferentialLogic</a> <a href="https://mathstodon.xyz/tags/Automata" class="mention hashtag" rel="nofollow noopener" target="_blank">#Automata</a> <a href="https://mathstodon.xyz/tags/FormalLanguages" class="mention hashtag" rel="nofollow noopener" target="_blank">#FormalLanguages</a> <a href="https://mathstodon.xyz/tags/FormalGrammars" class="mention hashtag" rel="nofollow noopener" target="_blank">#FormalGrammars</a> <a href="https://mathstodon.xyz/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#GraphTheory</a>

Jon AwbreyCactus Language • Overview 1.1 • <a href="https://inquiryintoinquiry.com/2025/03/01/cactus-language-overview-1/" rel="nofollow noopener" translate="no" target="_blank">https://inquiryintoinquiry.com/2025/03/01/cactus-language-overview-1/</a>❝Thus, what looks to us like a sphere of scientific knowledge more accurately should be represented as the inside of a highly irregular and spiky object, like a pincushion or porcupine, with very sharp extensions in certain directions, and virtually no knowledge in immediately adjacent areas. If our intellectual gaze could shift slightly, it would alter each quill’s direction, and suddenly our entire reality would change.❞— Herbert J. Bernstein • “Idols of Modern Science”The following report describes a calculus for representing propositions as sentences, that is, as syntactically defined sequences of signs, and for working with those sentences in light of their semantically defined contents as logical propositions. In their computational representation the expressions of the calculus parse into a class of graph‑theoretic data structures whose underlying graphs are called “painted cacti”.Painted cacti are a specialization of what graph‑theorists refer to as “cacti”, which are in turn a generalization of what they call “trees”. The data structures corresponding to painted cacti have especially nice properties, not only useful in computational terms but interesting from a theoretical standpoint. The remainder of the present Overview is devoted to motivating the development of the indicated family of formal languages, going under the generic name of Cactus Language.<a href="https://mathstodon.xyz/tags/Peirce" class="mention hashtag" rel="nofollow noopener" target="_blank">#Peirce</a> <a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="nofollow noopener" target="_blank">#Logic</a> <a href="https://mathstodon.xyz/tags/Semiotics" class="mention hashtag" rel="nofollow noopener" target="_blank">#Semiotics</a> <a href="https://mathstodon.xyz/tags/LogicalGraphs" class="mention hashtag" rel="nofollow noopener" target="_blank">#LogicalGraphs</a> <a href="https://mathstodon.xyz/tags/DifferentialLogic" class="mention hashtag" rel="nofollow noopener" target="_blank">#DifferentialLogic</a> <a href="https://mathstodon.xyz/tags/Automata" class="mention hashtag" rel="nofollow noopener" target="_blank">#Automata</a> <a href="https://mathstodon.xyz/tags/FormalLanguages" class="mention hashtag" rel="nofollow noopener" target="_blank">#FormalLanguages</a> <a href="https://mathstodon.xyz/tags/FormalGrammars" class="mention hashtag" rel="nofollow noopener" target="_blank">#FormalGrammars</a> <a href="https://mathstodon.xyz/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#GraphTheory</a>

Jon AwbreyTheme One Program • Motivation 1 • <a href="https://inquiryintoinquiry.com/2024/06/03/theme-one-program-motivation-1-b/" rel="nofollow noopener" translate="no" target="_blank">https://inquiryintoinquiry.com/2024/06/03/theme-one-program-motivation-1-b/</a>The main idea behind the Theme One program is the efficient use of graph‑theoretic data structures for the tasks of “learning” and “reasoning”.I am thinking of “learning” in the sense of learning about an environment, in essence, gaining information about the nature of an environment and being able to apply the information acquired to a specific purpose.Under the heading of “reasoning” I am simply lumping together all the ordinary sorts of practical activities which would probably occur to most people under that name.There is a natural relation between the tasks. Learning the character of an environment leads to the recognition of laws which govern the environment and making full use of that recognition requires the ability to reason logically about those laws in abstract terms.Resources —Theme One Program • Overview • <a href="https://oeis.org/wiki/Theme_One_Program_%E2%80%A2_Overview" rel="nofollow noopener" translate="no" target="_blank">https://oeis.org/wiki/Theme_One_Program_%E2%80%A2_Overview</a>Theme One Program • Exposition • <a href="https://oeis.org/wiki/Theme_One_Program_%E2%80%A2_Exposition" rel="nofollow noopener" translate="no" target="_blank">https://oeis.org/wiki/Theme_One_Program_%E2%80%A2_Exposition</a>Theme One Program • User Guide • <a href="https://www.academia.edu/5211369/Theme_One_Program_User_Guide" rel="nofollow noopener" translate="no" target="_blank">https://www.academia.edu/5211369/Theme_One_Program_User_Guide</a>Survey of Theme One Program • <a href="https://inquiryintoinquiry.com/2024/02/26/survey-of-theme-one-program-6/" rel="nofollow noopener" translate="no" target="_blank">https://inquiryintoinquiry.com/2024/02/26/survey-of-theme-one-program-6/</a><a href="https://mathstodon.xyz/tags/ThemeOneProgram" class="mention hashtag" rel="nofollow noopener" target="_blank">#ThemeOneProgram</a> <a href="https://mathstodon.xyz/tags/Learning" class="mention hashtag" rel="nofollow noopener" target="_blank">#Learning</a> <a href="https://mathstodon.xyz/tags/Reasoning" class="mention hashtag" rel="nofollow noopener" target="_blank">#Reasoning</a> <a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="nofollow noopener" target="_blank">#Logic</a> <a href="https://mathstodon.xyz/tags/LogicalGraphs" class="mention hashtag" rel="nofollow noopener" target="_blank">#LogicalGraphs</a> <a href="https://mathstodon.xyz/tags/FormalLanguages" class="mention hashtag" rel="nofollow noopener" target="_blank">#FormalLanguages</a> <a href="https://mathstodon.xyz/tags/Algorithm" class="mention hashtag" rel="nofollow noopener" target="_blank">#Algorithm</a> <a href="https://mathstodon.xyz/tags/DataStructure" class="mention hashtag" rel="nofollow noopener" target="_blank">#DataStructure</a> <a href="https://mathstodon.xyz/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#GraphTheory</a> <a href="https://mathstodon.xyz/tags/Peirce" class="mention hashtag" rel="nofollow noopener" target="_blank">#Peirce</a> <a href="https://mathstodon.xyz/tags/PragmaticSemioticInformation" class="mention hashtag" rel="nofollow noopener" target="_blank">#PragmaticSemioticInformation</a> <a href="https://mathstodon.xyz/tags/Empiricism" class="mention hashtag" rel="nofollow noopener" target="_blank">#Empiricism</a> <a href="https://mathstodon.xyz/tags/Rationalism" class="mention hashtag" rel="nofollow noopener" target="_blank">#Rationalism</a> <a href="https://mathstodon.xyz/tags/Pragmatism" class="mention hashtag" rel="nofollow noopener" target="_blank">#Pragmatism</a>

marcoToday (3PM GMT, May 15), I will be hosting this week's Formal Language and Neural Networks (FLaNN - <a href="https://flann.super.site/" target="_blank" rel="nofollow noopener" translate="no">https://flann.super.site/</a>) seminar. The speaker is Frank Drewes from Umeå University, who will be talking about Graph Extension Grammars.This is a fantastic weekly seminar focusing on the interpretability and computational power of neural language models, especially as related to formal languages.Check out the site for past and future talks! <a href="https://sigmoid.social/tags/ML" class="mention hashtag" rel="tag">#ML</a> <a href="https://sigmoid.social/tags/Interpretability" class="mention hashtag" rel="tag">#Interpretability</a> <a href="https://sigmoid.social/tags/FormalLanguages" class="mention hashtag" rel="tag">#FormalLanguages</a>

Jon AwbreyTheme One Program • Exposition 1.2 • <a href="https://inquiryintoinquiry.com/2022/06/15/theme-one-program-exposition-1-2/" rel="nofollow noopener" translate="no" target="_blank">https://inquiryintoinquiry.com/2022/06/15/theme-one-program-exposition-1-2/</a>The Idea↑Form FlagThe graph-theoretic data structures used by the program are built up from a basic data structure called an “idea-form flag”. That structure is defined as a pair of Pascal data types by means of the following specifications.Figure 1. Type Idea = ^Form • <a href="https://inquiryintoinquiry.files.wordpress.com/2022/06/theme-exposition-type-idea-5eform.png" rel="nofollow noopener" translate="no" target="_blank">https://inquiryintoinquiry.files.wordpress.com/2022/06/theme-exposition-type-idea-5eform.png</a>Figure 2. Code Box • type idea = ^form; • form = record • sign: char; • as, up, on, by: idea; • code: numb • end;An “idea” is a pointer to a “form”. • A “form” is a record consisting of: • A “sign” of type “char”; • Four pointers, “as”, “up”, “on”, “by”, of type “idea”; • A “code” of type “numb”, that is, an integer in [0, max integer].Represented in terms of “digraphs”, or directed graphs, the combination of an idea pointer and a form record is most easily pictured as an “arc”, or directed edge, leading to a node labeled with the other data, in this case, a letter and a number.<a href="https://mathstodon.xyz/tags/ThemeOneProgram" class="mention hashtag" rel="nofollow noopener" target="_blank">#ThemeOneProgram</a> <a href="https://mathstodon.xyz/tags/Learning" class="mention hashtag" rel="nofollow noopener" target="_blank">#Learning</a> <a href="https://mathstodon.xyz/tags/Reasoning" class="mention hashtag" rel="nofollow noopener" target="_blank">#Reasoning</a> <a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="nofollow noopener" target="_blank">#Logic</a> <a href="https://mathstodon.xyz/tags/LogicalGraphs" class="mention hashtag" rel="nofollow noopener" target="_blank">#LogicalGraphs</a> <a href="https://mathstodon.xyz/tags/FormalLanguages" class="mention hashtag" rel="nofollow noopener" target="_blank">#FormalLanguages</a> <a href="https://mathstodon.xyz/tags/Algorithm" class="mention hashtag" rel="nofollow noopener" target="_blank">#Algorithm</a> <a href="https://mathstodon.xyz/tags/DataStructure" class="mention hashtag" rel="nofollow noopener" target="_blank">#DataStructure</a> <a href="https://mathstodon.xyz/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#GraphTheory</a> <a href="https://mathstodon.xyz/tags/Peirce" class="mention hashtag" rel="nofollow noopener" target="_blank">#Peirce</a> <a href="https://mathstodon.xyz/tags/PragmaticSemioticInformation" class="mention hashtag" rel="nofollow noopener" target="_blank">#PragmaticSemioticInformation</a> <a href="https://mathstodon.xyz/tags/Empiricism" class="mention hashtag" rel="nofollow noopener" target="_blank">#Empiricism</a> <a href="https://mathstodon.xyz/tags/Rationalism" class="mention hashtag" rel="nofollow noopener" target="_blank">#Rationalism</a> <a href="https://mathstodon.xyz/tags/Pragmatism" class="mention hashtag" rel="nofollow noopener" target="_blank">#Pragmatism</a>

Jon AwbreyTheme One Program • Exposition 1.1 • <a href="https://inquiryintoinquiry.com/2024/06/09/theme-one-program-exposition-1-b/" rel="nofollow noopener" translate="no" target="_blank">https://inquiryintoinquiry.com/2024/06/09/theme-one-program-exposition-1-b/</a>Theme One is a program for constructing and transforming a particular species of graph‑theoretic data structures, forms designed to support a variety of fundamental learning and reasoning tasks.The program evolved over the course of an exploration into the integration of contrasting types of activities involved in learning and reasoning, especially the types of algorithms and data structures capable of supporting all sorts of inquiry processes, from everyday problem solving to scientific investigation. In its current state, Theme One integrates over a common data structure fundamental algorithms for one type of inductive learning and one type of deductive reasoning.We begin by describing the class of graph-theoretic data structures used by the program, as determined by their local and global features. It will be the usual practice to shift around and view these graphs at many different levels of detail, from their abstract definition to their concrete implementation, and many points in between.The main work of the Theme One program is achieved by building and transforming a single species of graph-theoretic data structures. In their abstract form these structures are closely related to the graphs called cacti and conifers in graph theory, so we’ll generally refer to them under those names.<a href="https://mathstodon.xyz/tags/ThemeOneProgram" class="mention hashtag" rel="nofollow noopener" target="_blank">#ThemeOneProgram</a> <a href="https://mathstodon.xyz/tags/Learning" class="mention hashtag" rel="nofollow noopener" target="_blank">#Learning</a> <a href="https://mathstodon.xyz/tags/Reasoning" class="mention hashtag" rel="nofollow noopener" target="_blank">#Reasoning</a> <a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="nofollow noopener" target="_blank">#Logic</a> <a href="https://mathstodon.xyz/tags/LogicalGraphs" class="mention hashtag" rel="nofollow noopener" target="_blank">#LogicalGraphs</a> <a href="https://mathstodon.xyz/tags/FormalLanguages" class="mention hashtag" rel="nofollow noopener" target="_blank">#FormalLanguages</a> <a href="https://mathstodon.xyz/tags/Algorithm" class="mention hashtag" rel="nofollow noopener" target="_blank">#Algorithm</a> <a href="https://mathstodon.xyz/tags/DataStructure" class="mention hashtag" rel="nofollow noopener" target="_blank">#DataStructure</a> <a href="https://mathstodon.xyz/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#GraphTheory</a> <a href="https://mathstodon.xyz/tags/Peirce" class="mention hashtag" rel="nofollow noopener" target="_blank">#Peirce</a> <a href="https://mathstodon.xyz/tags/PragmaticSemioticInformation" class="mention hashtag" rel="nofollow noopener" target="_blank">#PragmaticSemioticInformation</a> <a href="https://mathstodon.xyz/tags/Empiricism" class="mention hashtag" rel="nofollow noopener" target="_blank">#Empiricism</a> <a href="https://mathstodon.xyz/tags/Rationalism" class="mention hashtag" rel="nofollow noopener" target="_blank">#Rationalism</a> <a href="https://mathstodon.xyz/tags/Pragmatism" class="mention hashtag" rel="nofollow noopener" target="_blank">#Pragmatism</a>

marcoThere are a four invited speakers, but I am only personally familiar with three (Cyril Allauzen @ Google, Will Merrill @ NYU/Google, and Dana Angluin @ Yale).These three talks should be fantastic, especially if you are interested in <a href="https://sigmoid.social/tags/automata" class="mention hashtag" rel="tag">#automata</a>, <a href="https://sigmoid.social/tags/FormalLanguages" class="mention hashtag" rel="tag">#FormalLanguages</a>, and <a href="https://sigmoid.social/tags/Interpretability" class="mention hashtag" rel="tag">#Interpretability</a> in neural language models!(Plugging <a href="https://flann.super.site/" target="_blank" rel="nofollow noopener" translate="no">https://flann.super.site/</a> if those sound cool to you)

Marco 🌳 Zoccathree days for nailing the correct order of parser combinators for a large language 🫠I think I'll need to add Bison/Yacc to my toolbelt<a href="https://sigmoid.social/tags/proglang" class="mention hashtag" rel="tag">#proglang</a> <a href="https://sigmoid.social/tags/plt" class="mention hashtag" rel="tag">#plt</a> <a href="https://sigmoid.social/tags/formallanguages" class="mention hashtag" rel="tag">#formallanguages</a> <a href="https://sigmoid.social/tags/compilers" class="mention hashtag" rel="tag">#compilers</a>

EscalatedQuickly :hecked:Might as well toot an <a href="https://infosec.exchange/tags/introduction" class="mention hashtag" rel="nofollow noopener" target="_blank">#introduction</a> as well.I've been here since 2019 according to my profile, but haven't tooted once until today.I'm a <a href="https://infosec.exchange/tags/cybersecurity" class="mention hashtag" rel="nofollow noopener" target="_blank">#cybersecurity</a> consultant who mainly does offensive security, but I very much enjoy picking apart <a href="https://infosec.exchange/tags/malware" class="mention hashtag" rel="nofollow noopener" target="_blank">#malware</a> given the opportunity. I'm also technically a Ph.D. student researching metamorphic malware packers, but right now I'm on a hiatus from academia.Other than <a href="https://infosec.exchange/tags/security" class="mention hashtag" rel="nofollow noopener" target="_blank">#security</a> I'm also drawn to completely normal things, like <a href="https://infosec.exchange/tags/categorytheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#categorytheory</a>, <a href="https://infosec.exchange/tags/formallanguages" class="mention hashtag" rel="nofollow noopener" target="_blank">#formallanguages</a>, <a href="https://infosec.exchange/tags/osdev" class="mention hashtag" rel="nofollow noopener" target="_blank">#osdev</a>, and most recently the <a href="https://infosec.exchange/tags/mainframe" class="mention hashtag" rel="nofollow noopener" target="_blank">#mainframe</a>. I'm also passionate about <a href="https://infosec.exchange/tags/foss" class="mention hashtag" rel="nofollow noopener" target="_blank">#foss</a>, <a href="https://infosec.exchange/tags/unix" class="mention hashtag" rel="nofollow noopener" target="_blank">#unix</a>, <a href="https://infosec.exchange/tags/linux" class="mention hashtag" rel="nofollow noopener" target="_blank">#linux</a>, <a href="https://infosec.exchange/tags/openaccess" class="mention hashtag" rel="nofollow noopener" target="_blank">#openaccess</a> and stuff like that.

Recent searches

Search options

Administered by:

Server stats:

#formallanguages