Message Boards Message Boards

[WSS22] Proof of useful ruliad work

Posted 2 years ago

enter image description here

Aknowledgements

James Boyd, and Christopher Wolfram

POSTED BY: Arturo Silva
2 Replies

Is it true that you could traverse the input space between the hash tables? Bitcoin mining? After all, we are just generating. We are generating data for the bipartite graph.

Graphics[
 CandlestickChart[
  MapIndexed[{
     DateList[
      DateObject[
       First[#2]]], #1
     } &, Flatten[
    Drop[
     Sort[
      Map[({#[[1]],
          {#[[2]][[1]],
           #[[2]][[1]],
           hash1[#[[2]][[2]]],
           hash2[#[[2]][[2]]]}
          }) &, list2],
      #1[[2]][[3]] < #2[[2]][[3]] &],
     0, 1],
    1]],
  TrendStyle -> {Orange, Green, Red},
  PlotLabel -> "Date Object \n from 1900 
and Hash Functions \n among list2.",
  PlotTheme -> "Business"]]

Candlestick Plot of Hash Function Divergence

The transposition of directed edges & exponential cycles in the Ruliad, this is so useful. It's really the cycle parameter; this post is the most entrepreneurial.

ComplexPlot[
 list2a[[
    With[
     {n = 2 AbsArg[n]},
     Round[(n[[1]])^(n[[2]])]]
    ]][[2]],
 {n, -1 - 1 I, 1 + 1 I},
 ColorFunction -> "CyclicReImLogAbs"]

Complex Plot Bath

You see the computational shortest path possible through the directed edges and how you are generating & indexing them..

POSTED BY: Dean Gladish

enter image description here -- you have earned Featured Contributor Badge enter image description here Your exceptional post has been selected for our editorial column Staff Picks http://wolfr.am/StaffPicks and Your Profile is now distinguished by a Featured Contributor Badge and is displayed on the Featured Contributor Board. Thank you!

POSTED BY: EDITORIAL BOARD
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard

Group Abstract Group Abstract