Search results

• Directory:Derek Elder/Programs/ReverseGraph
  TypedBufferReader tbr = new TypedBufferReader("Enter name of file with graph"); String line = tbr.readLine();
  2 KB (263 words) - 23:05, 2 November 2009
• Graph (mathematics)
  ...ics, see ''[[graph of a function]]''. For the more general concept of the graph of a relation, see ''[[relation (mathematics)|relation]]''. [[Image:6n-graf.svg|thumb|250px|A labeled graph on 6 vertices and 7 edges.]]
  13 KB (1,934 words) - 12:06, 6 September 2007
• Graph theory
  : ''For an introduction to graph theory see [[Graph (mathematics)]]''. ...e from point ''B'' to point ''A''. In a ''digraph'', short for ''directed graph'', the two directions are counted as being distinct ''arcs'' or ''directed
  17 KB (2,473 words) - 11:44, 6 September 2007
• Directory:Derek Elder/Programs/Reachable
  TypedBufferReader tbr = new TypedBufferReader("Enter name of file with graph"); String line = tbr.readLine();
  4 KB (518 words) - 23:07, 2 November 2009
• User:Jon Awbrey/OLDSANDBOX
  :* The second part is called the ''graph'' of <math>L</math>, written <math>graph\,(L)</math> or <math>G(L).</math> ...r concreteness a '''k-place relation''', the concepts of its frame and its graph are defined as follows:
  43 KB (6,715 words) - 13:25, 22 June 2009
• Directory:Jon Awbrey/Papers/Propositions As Types
  '''Existential Graph Format : Application Triples with Structure Sharing''' Redo the same development in Existential Graph notation. In the work below, the term development is carried out in revers
  150 KB (9,422 words) - 23:54, 6 July 2013
• User:Jon Awbrey/ARCHIVE
  # [[Logical Graph]] # [[Logical graph]]
  39 KB (4,682 words) - 14:55, 21 May 2007
• Coordinated Universal Time
  [[Image:Leapsecond.ut1-utc.svg|thumb|left|250px|Graph showing the difference [[DUT1]] between UT1 and UTC. Vertical segments corr ...n a few millennia, when there have been 86400 leap seconds. This erroneous line of reasoning confuses velocity (2 ms per day) with travelled distance (abou
  20 KB (3,170 words) - 16:36, 6 December 2006
• Directory:Jon Awbrey/SANDBOX
  :* The second part is called the ''graph'' of <math>L</math>, written <math>graph\,(L)</math> or <math>G(L).</math> ...r concreteness a '''k-place relation''', the concepts of its frame and its graph are defined as follows:
  46 KB (7,067 words) - 04:10, 22 May 2010
• Logic of information
  ...the lines initially developed by [[Charles Sanders Peirce]].&nbsp; In this line of development the concept of information serves to integrate the aspects o * [[Logical graph]]
  8 KB (1,038 words) - 03:24, 16 November 2015
• Directory:SEO Tools
  The Alexa Traffic History Graph allows you to create a traffic history graph for any site. ...<input tabindex=12 type=submit name="submit" id="submit" value="Display Graph"><p><a rel="nofollow" href="http://www.developershed.com/esupport/"><font c
  83 KB (12,213 words) - 17:34, 16 September 2007
• User:Roygbiv/Graph
  A '''logical graph''' is a [[graph theory|graph-theoretic]] structure in one of the systems of graphical [[syntax]] that [h ...aph]]s'', Peirce developed several versions of a graphical formalism, or a graph-theoretic formal language, designed to be interpreted for logic.
  42 KB (5,905 words) - 21:49, 22 May 2010
• Logical graph
  A '''logical graph''' is a graph-theoretic structure in one of the systems of graphical syntax that Charles ...graphs'', Peirce developed several versions of a graphical formalism, or a graph-theoretic formal language, designed to be interpreted for logic.
  41 KB (5,845 words) - 14:26, 6 November 2015
• Directory:Jon Awbrey/Papers/Theme One Program : Exposition
  of graph-theoretical data structures in memory, structures that have been graph-theoretical data structures that are used by the program,
  94 KB (8,938 words) - 22:12, 9 December 2015
• Directory:Jon Awbrey/Papers/Peirce's Logic Of Information
  In future, then, I'll feel free to represent a graph by means of its matrix, especially whenever I can't easily draw it, and saf This is the incidence matrix of a ''concretely labeled graph''.
  73 KB (8,310 words) - 00:36, 27 April 2017
• Turing Award
  ...omputer program|program]]. Built in 1949, the EDSAC used a [[mercury delay line memory]]. He is also known as the author, with Wheeler and Gill, of a volum ...ion. His fifteen years of publications extend from theoretical articles on graph theory to basic manuals, expository texts, and philosophical contemplations
  11 KB (1,508 words) - 10:52, 2 November 2006
• Directory:Jon Awbrey/Papers/Dynamics And Logic
  | [[Image:Cactus Graph Existential P And Q.jpg|500px]] | [[Image:Cactus Graph Existential True.jpg|500px]]
  127 KB (18,875 words) - 13:28, 10 December 2014
• Directory:Jon Awbrey/Papers/Differential Logic : Introduction
  ...k\!</math>-ary scope. The formulas of this calculus map into a species of graph-theoretical structures called ''painted and rooted cacti'' (PARCs) that len | [[Image:Cactus Graph Lobe Connective.jpg|500px]]
  131 KB (20,198 words) - 15:38, 2 December 2015
• Directory:Jon Awbrey/Papers/Differential Analytic Turing Automata
  ...led because 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 | <math>\text{Graph}\!</math>
  134 KB (16,535 words) - 15:30, 11 October 2013
• Sign relation
  ...given which no more refers to human thought than does the definition of a line as the place which a particle occupies, part by part, during a lapse of tim ...'informational'' determination, as in saying &ldquo;two points determine a line&rdquo;, rather than the more special cases of causal and temporal determini
  58 KB (8,260 words) - 03:40, 21 November 2016

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