Search results

• Turing Award
  ...is fifteen years of publications extend from theoretical articles on graph theory to basic manuals, expository texts, and philosophical contemplations in the ...ng to found the following important subfields of [[computer science]]: the theory of [[parsing]], the [[semantics]] of programming languages, automatic [[pro
  11 KB (1,508 words) - 10:52, 2 November 2006
• Directory:Jon Awbrey/Projects/Theme One Program
  [[Category:Computational Complexity]] [[Category:Graph Theory]]
  18 KB (2,189 words) - 14:24, 9 August 2016
• Chess
  ...wikipedia.org/wiki/Chess" TARGET="_blank" ^[1]</a> The game-tree complexity of chess was first calculated by Claude Shannon as 10 120, a number known a
  32 KB (5,321 words) - 01:45, 6 April 2012
• Directory:Jon Awbrey/Papers/Differential Propositional Calculus
  ===Appendix 3. Computational Details=== [[Category:Computational Complexity]]
  158 KB (22,468 words) - 03:24, 27 December 2016
• Directory:Jon Awbrey/MathJax Problems
  Managing the conceptual complexity of our considerations at this juncture put us in need of some conceptual to ...hat one might compile a theory from axioms without knowing what either the theory or the axioms were about &mdash; and the best way to sum up the state of in
  59 KB (5,442 words) - 19:40, 8 November 2016
• Introduction to Inquiry Driven Systems
  80 bytes (10 words) - 11:56, 6 October 2010
• User:Roygbiv/Graph
  A '''logical graph''' is a [[graph theory|graph-theoretic]] structure in one of the systems of graphical [[syntax]] t ==Computational representation==
  42 KB (5,905 words) - 21:49, 22 May 2010
• Directory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 4
  ...ken, forward course by following steps that are never unsure. Acquiring a theory of inquiry is not, in short, a purely deductive exercise. ...o positive proof can arise from so negative a recommendation. Acquiring a theory of inquiry is not, in sum, a purely inductive exercise.
  92 KB (15,197 words) - 14:40, 24 August 2017
• Logical graph
  ==Computational representation== ...p, one layer, one piece at a time, and it's just as much the case when the complexity of the object is irreducible, that is, when the articulations of the repres
  41 KB (5,845 words) - 14:26, 6 November 2015
• Directory:Jon Awbrey/Papers/Differential Analytic Turing Automata
  ...cause it uses a species of graphs that are usually called "cacti" in graph theory. The last exposition of the cactus syntax that I've written can be found h The representational and computational efficiency of the cactus language for the tasks that are usually associated
  134 KB (16,535 words) - 15:30, 11 October 2013
• Directory:Jon Awbrey/Papers/Introduction to Inquiry Driven Systems
  ...d on the pragmatic theory of inquiry and its relationship to the pragmatic theory of signs. ...re of inquiry processes, with an eye to those elements that can be given a computational basis.
  121 KB (16,341 words) - 04:34, 30 October 2015
• Directory:Jon Awbrey/Papers/Change In Logic
  Linear Topics. The Differential Theory of Qualitative Equations that are employed in mathematical systems theory
  73 KB (6,208 words) - 04:08, 11 December 2016
• User:Jon Awbrey/PROSPECT
  of systems theory and artificial intelligence to each other. in systems theory, working to extend its concepts and methods
  162 KB (25,941 words) - 13:28, 9 January 2008
• Directory:Jon Awbrey/Papers/Cactus Language
  ...have especially nice properties, turning out to be not only useful from a computational standpoint but also quite interesting from a theoretical point of view. Th For computational purposes, it is convenient to have a middle ground or an intermediate langu
  211 KB (31,551 words) - 20:44, 2 August 2017
• Directory:Jon Awbrey/Papers/Propositional Equation Reasoning Systems
  ...of-theoretic purity somewhere in the middle of grinding this calculus into computational form, I never got around to finding the most elegant and minimal, or anythi ...other name for the theory of inquiry is ''logic'' and another name for the theory of signs is ''semiotics''. So I might as well have said that I am interest
  157 KB (17,761 words) - 03:44, 10 November 2016
• Directory:Jon Awbrey/Papers/Differential Logic : Introduction
  ...propositions. A calculus that is very efficient from both conceptual and computational standpoints is based on just two types of logical connectives, both of vari ...ast of which has been the lack of a syntax that was adequate to handle the complexity of expressions that evolve.
  131 KB (20,198 words) - 15:38, 2 December 2015
• Directory:Jon Awbrey/Papers/Futures Of Logical Graphs
  ...day mathematical bearing, but also in way that's not unrelated to Peirce's theory of categories. ...ur consideration of logical graphs, as seems most fitting, within Peirce's theory of triadic sign relations, we have declared the first layers of our object,
  168 KB (21,027 words) - 12:41, 6 August 2017
• Directory:Jon Awbrey/Papers/Dynamics And Logic
  ...ast of which has been the lack of a syntax that was adequate to handle the complexity of expressions that evolve. ...hat will extend a gentle invitation to the mathematical subject of ''group theory'', and demonstrate its relevance to differential logic in a strikingly apt
  127 KB (18,875 words) - 13:28, 10 December 2014
• User:Jon Awbrey/Examples Of Inquiry
  of inquiry as a dynamic process of theory change. of inquiry as a dynamic process of theory change.
  139 KB (16,717 words) - 14:30, 12 September 2017
• Directory:Jon Awbrey/Essays/Prospects For Inquiry Driven Systems
  ...In the current phase of investigation I am taking a standpoint in systems theory, working to extend its concepts and methods to cover increasingly interesti ...work of the past few years I have sought to apply the framework of systems theory to the problems of AI. I believe that viewing intelligent systems as dynam
  226 KB (34,541 words) - 14:20, 20 August 2016

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)