Hopefully, this will be a characterization that can be agreed upon so we won’t have to continue any wild guessing due to lack of a consistent description.
Thanks for the efforts. Am 10.01.21 um 07:46 schrieb Justin Paston-Cooper: > Error: Base sets of nodes, and not base hyperedges. Each hyperedge touches > at most one element of each base set. > > On Sun, 10 Jan 2021 at 09:35, Justin Paston-Cooper <[email protected]> > wrote: > >> Can we summarise all of this as: >> >> A representation of hypergraphs ordered in a certain way, with nodes >> represented by numbers, and tuples of numbers for representing the >> hyperedges. Node values are ordered sets of strings. >> >> There is a number of base hyperedges (columns), whose disjoint union gives >> the set of starting nodes. Over the nodes in each base hyperedge is defined >> an ordering. There is an ordering defined between the base hyperedges also. >> This gives an ordering over all base nodes. >> >> Define new values for possibly new hyperedges at will by taking unions of >> subsets from each base hyperedge, and adding a node to the ordered set >> corresponding to this hyperedge if it exists, or creating a new one if it >> doesn’t. >> >> The orders of these hyperedges and the nodes within are defined using the >> orders of the constituent base hyperedges, and the orders of the ordered >> sets of the new added nodes. >> >> Queries are hypergraph traversals. >> >> Sorry if I’m being obtuse again. >> >> On Sat, 9 Jan 2021 at 23:11, 'Bo Jacoby' via Programming < >> [email protected]> wrote: >> >>> Justin wrote: "Quite an interesting paper. What were the reasons for its >>> rejection?" >>> Thank you! The referee wrote that he did not consider me serious. He >>> thought I was joking. >>> I wrote an article to en.wikipedia.org, but as original research is not >>> allowed on wikipedia the article was deleted. However in the >>> meantime someone copied it to StateMaster.com Encyclopedia, but by now it >>> is not to be found. Most of my research turns out not to be original >>> research, but the theory of ordinal fractions seems to be original >>> research. >>> The CREDO example was published in Danish in the NordDATA 89 conference >>> procedings, volume 3, page 779-785. About one out of thousand read Danish. >>> The example is in Latin. About one out of thousand read Latin. The program >>> is in BASIC. About one out of thousand read BASIC. So about one out of a >>> billion can read the paper. I think I do know the other 6. The title is >>> 'ULTRA-FLEKSIBEL DATABASESTRUKTUR OG KUNSTIG KATOLICISME' meaning: ultra >>> flexible data base structure and artificial catholicism. >>> Hauke is suggesting improvements. I have worked with ordinal fractions >>> for forty years. Understand before improving. >>> The ordinal fraction data base may be a tree, or a wood, or an array, or >>> a relational data base, or any combination of these. Knowing ordinal >>> fractions you do no longer need trees, woods, arrays, or relational data >>> bases. The CREDO example is neither a tree, a wood, an array, nor a >>> relational data base. >>> The CREDO file is not sorted. ' AMEN' is the last word, even if it has >>> line number 0 because is is included in every prayer. In a sorted file AMEN >>> would come first. >>> J programs are compact. I love it! So I expect that 8 lines of BASIC can >>> be converted into an even shorter J program. >>> Thank you all ! >>> Bo >>> >>> >>> Den lørdag den 9. januar 2021 18.49.14 CET skrev Justin Paston-Cooper >>> <[email protected]>: >>> >>> On Sat, 9 Jan 2021 at 15:59, Hauke Rehr <[email protected]> wrote: >>>> >>>> My two comments (or, my 2¢): >>>> >>>> >>>> concerning the aleph numbers >>>> >>>> is this related to my concern about dependence on order? >>>> I understand the fractional digits to be meant to encode >>>> both (semantic) structure and order >>>> (or else the prayer wouldn’t be the best kind of example). >>> >>> Yes I think so. >>> >>>> >>>> After all, that’s why they’re doing ‘more’ than their >>>> relational counterparts where all columns are considered >>>> independent of each other and applicable to all of the data. >>>> >>>> >>>> concerning people’s workflows >>>> >>>> now that’s why I had been talking about the LEO editor >>>> because the discussion had been originated by a question >>>> about structuring one’s research; and I wanted to offer >>>> concrete suggestions as to how to actually get to using >>>> a system like this without the need of setting up a kind >>>> of database first. >>> >>> I didn't have time to look into it the first time, but Leo looks >>> really interesting for the document management part. It got me >>> thinking about Xanadu: https://xanadu.com/xUniverse-D6. Thank you. >>> >>>> >>>> The ordinal fractions could then be implicit in the tree >>>> structure of the nodes (you only have to have a convention >>>> for which node will be considered the 0 (aka ANY) node; >>>> and maybe another one on if/how an empty node is to be >>>> represented). >>>> >>>> The query script could then ask for digits and after each >>>> one give the list of subordinate valid digits and their >>>> meanings (semantics will be documented at each level); >>>> this will get a bit more complicated with queries with >>>> early 0s but then again, they should make sense mostly >>>> when the semantic structure at subordinate levels agrees >>>> which could result in a merge of the respective display >>>> of subordinate digits’ meanings. >>>> >>>> but this would require the fractions to be used >>>> the way I first understood it: the data is to be stored >>>> in “leaf” nodes only. I guess this would be the easiest >>>> and most easily manageable – also in terms of maintenance – >>>> approach. >>>> >>>> >>>> Hauke >>>> >>>> >>>> >>> ---------------------------------------------------------------------- >>> For information about J forums see http://www.jsoftware.com/forums.htm >>> >>> ---------------------------------------------------------------------- >>> For information about J forums see http://www.jsoftware.com/forums.htm >>> >> > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > -- ---------------------- mail written using NEO neo-layout.org ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
