Want to read Slashdot from your mobile device? Point it at m.slashdot.org and keep reading!

 



Forgot your password?
typodupeerror
×
AI Education Programming

Researcher Writes A Machine Language For The Universe (typepad.com) 102

Slashdot reader smugfunt shares a blog post from systems scientist George Mobus: "There is a fundamental language of systems that provides a way to describe both structures and functions that is universal across any kind of system... I am nearing completion of the basic specification of the language and will be presenting my results at the next ISSS conference in Boulder CO this July... This language, which I formally call SL, but privately call "systemese", is like the machine language of the universe. Any system you choose to analyze and model can be described in this language...!

The beauty of the approach is that the end product of analysis is a compilable program that is the model of the system. The language does not just cover dynamics (e.g. system dynamics), or agents (agent-based), or evolutionary (e.g., genetic algorithms) models. It incorporates all of the above plus real adaptivity and learning (e.g. biological-like), and real evolvability (as when species or corporations evolve in complex non-stationary environments)... Systemese and mentalese (the language of thought), a concept advanced by philosopher of mind Jerry Fodor, are basically one in the same! That is, our brains, at a subconscious level, use systemese to construct our models of how the world works.

This discussion has been archived. No new comments can be posted.

Researcher Writes A Machine Language For The Universe

Comments Filter:
  • Peter Parker says (Score:5, Insightful)

    by Anonymous Coward on Sunday May 08, 2016 @08:36AM (#52070213)

    My BS sense is tingling!

    • Re:Peter Parker says (Score:5, Informative)

      by plopez ( 54068 ) on Sunday May 08, 2016 @08:54AM (#52070263) Journal

      Well you can tell him about it here: http://questioneverything.type... [typepad.com]

      • That page is tedious. The author provides no real description of his language other than to say it 'has a basic lexicon, syntax, and semantics' and 'is like the machine language of the universe. Any system you choose to analyze and model can be described in this language!' He asserts that his 'systemese' is based upon the way the human brain models systems. He reaches further at points to try to tie in the notion of sapience (read 'wisdom').

        My instinct as a programmer tells me that once one actually tries

    • by Anonymous Coward
      I'm surprised you can sense anything under that bovine manure avalanche.
    • Let me put it this way...

      Any system you choose to analyze and model can be described in this language...!

      Now any modelling problem is simply reduced to expressing the desired system in this language...!

      Remember the buzz around formal specifications in software engineering (Z, how I love thee) about 25 years ago? Ever wondered what happened to that? Well, it turned out that for the vast majority of non-toy problems, writing and debugging the formal specification was just as hard as writing and debugging the

  • by pushing-robot ( 1037830 ) on Sunday May 08, 2016 @08:37AM (#52070221)

    I call it "Physics".

    • by PolygamousRanchKid ( 1290638 ) on Sunday May 08, 2016 @09:13AM (#52070329)

      But with his language, no matter how you program it . . . the output is always is 42 . . .

      • by epine ( 68316 )

        But with his language, no matter how advanced civilization becomes . . . the output is always an old joke beaten for the 1,000,000,042nd time . . .

    • Other approaches to hacking the universe are called "Quantum Computing" and "LSD".

    • by Okian Warrior ( 537106 ) on Sunday May 08, 2016 @02:47PM (#52071815) Homepage Journal

      For the past couple of months I've been idly trying to deduce how the universe works from the point of view of a computable machine. (It's sort of a relaxing hobby I use to cleanse my mental palette from the day job.)

              Basically, assume that the universe is computable. This means that all information must be represented by a *finite* amount of information - position, probability, and so on. Computability in this sense means that any operation must complete in a finite amount of time(*).

              This implies that space must be quantized, because having infinite precision in position requires an infinitely long floating point number, which would be uncomputable. So far so good.

              A quantized space is roughly analogous to binary B/W images, and in order to prevent "jaggies" we have Bresenham's algorithm [wikipedia.org] and anti-aliasing [wikipedia.org].

              So the wave nature of particles seems like the universe's answer to anti-aliasing: you have the probability of particle position be in multiple places at once depending on it's movement, and you choose one when you do an interaction. The "position" of a particle is held as a sum of waves, and this can be represented as a bit field, where each "1" in the field indicates that the wave of that frequency is part of the position, and "0" says that the frequency is not(**).

              The advantage is that you can calculate a sin wave to arbitrary precision depending on your needs. If you want a particle position in order to do an interaction, you start rolling binary dice bit-by-bit until you get a "1" on your dice. Each time you roll a "0", you calculate the position to finer and finer levels of detail. When you roll a "1", that sets the position of the particle and you then do the interaction.

              The problem with all this is that a complete description gets wildly complex. Each pair of entangled photons has a link to the other, so that if you collapse the waveform on one you have to collapse the other as well.

              When a photon hits a semi-silvered mirror, the path becomes *two* paths that have to be added together. When it encounters a regular mirror, the sin() and cos() terms are swapped.

              When you get to the point of interaction, you have to add together for *all* possible paths the photon could have taken, including all the non-straight lines, and blocked direct paths.

              This is wildly complex, and defies conventional representation! What data structure is needed to keep track of all these paths?

              (As a thought problem, consider a photon emitted from a galaxy. An ever-expanding sphere of probability extends from the point of origin, with pieces of the sphere interacting with everything it encounters, said pieces can be reflected or bent or modified in various ways, and this goes on for billions of years. When it reaches a point of interaction, all these myriad pieces get added together to make the probability that the photon appears at the interaction point. And yet, we encounter photons from distant galaxies all the time.)

              If someone has sorted this out and created a truly universal representation of the universe, it would be a landmark paper and sit alongside Einstein's discovery of relativity and QM, and Newton's discovery of gravitation and integration.

              (*) With one-and-only-one *possible* exception being the entire program. Individual interactions must be resolved in a finite time, but the total universe is allowed to go on forever.

              (**) A little more complicated than this, because the amplitudes can be +1/0/-1, and there's sin() and cos() components, but I don't want to cloud the description with details.

      • What you describe is fascinating, and I'd love to read more.

        That said, because quantum physics seems to tie reality to perception, doesn't that suggest that only the paths of photons which are perceived need to be computed? That's kind of what Schrodinger's Cat is trying to tell us, isn't it? Detailed computations for the unobserved are unnecessary, but some bulk calculation will have to be made, when they become observed. A cat in a box remains in its living state, until the box is opened, at which point,

        • What you describe is fascinating, and I'd love to read more.

          I am exactly nowhere on this. I'm starting to believe that position is an emergent phenomena, and not an attribute of particles.

          For example, suppose you set up an interference experiment where a photon has 90% chance of going into one detector, and 10% chance of getting into the other. How much resolution is there in these numbers?

          Experimentally, it would appear that probabilities are precise to hundreds of digits... for each and every photon.

          No matter what data structures I come up with, nothing seems to a

          • by mattr ( 78516 )

            That was very cool, thank you.
            IANAP but... How to allow very high precision?
            Not so bad (except for us) if you
            have a feedback to limit the number
            of pesky observers.
            Also might not be a bad reason for
            c and the expansion of the universe, since
            our local processor need only worry
            about what is in our light cone.
            Less even than that if you have mortals
            without fast space travel and you occlude
            the nearby interesting bits with clouds
            and supernovae. Sorry.
            How to handle infinite superpositions?
            Perhaps we need another sys

            • by mattr ( 78516 )

              Unfortunately, I may have just solved the Fermi paradox. Either due to system enforcing a hard limit on observers especially if they can talk and corroborate observations, or due to other civilizations / virii trying to grab more processor resources by getting rid of the competition.
              It also might mean you can do more cool, magical things if you keep a lid on it.

              I hope I'm wrong. :/

      • Note that floating point numbers is just one of several ways of representing precision in a computer. Some alternatives like unum may be better.
      • by ( 4475953 )

        While some physicists might disagree, I think your post shouldn't really have been modded 'funny'. Stephen Wolfram also likes the idea that the universe could be a finite automaton. Some people also claim that there is a disconnect between physical laws and the way they are formulated: If real numbers existed in physical reality, they would violate various physical laws, e.g. the laws of thermodynamics. This problem is rarely addressed by physicists, probably because it's a bit too philosophical and concern

      • Really, isn't the question: when does collapse happen? And really, what constitutes an observation? I know that was a piece of Von Neumann's Automata as well, and it really gets at the heart of the issue - because if you need a person to do it, then you have most of the universe that is entangled with most other parts of the universe and nothing to ever stop it until a photon gets into our region of the universe... and then does everything entangled with that photon collapse entirely as soon as it hits a hu

  • by Anonymous Coward

    General Systems Theory was bullshit 50 years ago and it hasn't changed since.

  • Any system? (Score:4, Insightful)

    by plopez ( 54068 ) on Sunday May 08, 2016 @08:46AM (#52070239) Journal

    Really? How about non-computational mathematics.

  • Inconsistency. (Score:5, Insightful)

    by Fragnet ( 4224287 ) on Sunday May 08, 2016 @08:50AM (#52070251)
    Your language is inconsistent [wikipedia.org].
    • No, it would be silly to make an inconsistent language, rather it would be incomplete.
      • Re:Inconsistency. (Score:4, Informative)

        by Fragnet ( 4224287 ) on Sunday May 08, 2016 @12:30PM (#52071179)
        A set of axioms is complete if, for any statement in the axioms' language, that statement or its negation is provable from the axioms (Smith 2007, p. 24). A set of axioms is (simply) consistent if there is no statement such that both the statement and its negation are provable from the axioms, and inconsistent otherwise. In the standard system of first-order logic, an inconsistent set of axioms will prove every statement in its language (this is sometimes called the principle of explosion), and is thus automatically complete. A set of axioms that is both complete and consistent, however, proves a maximal set of non-contradictory theorems (Hinman 2005, p. 143). Gödel's incompleteness theorems show that in specific cases, it is not possible to obtain a formal system that is effectively generated, complete, and consistent.
        • Gödel's incompleteness theorems show that in specific cases, it is not possible to obtain a formal system that is effectively generated, complete, and consistent.

          That's what I said, yes. But thanks anyway.

      • No, it would be silly to make an inconsistent language, rather it would be incomplete.

        Not necessarily: paraconsistent logic [stanford.edu]

  • In summary (Score:5, Insightful)

    by AchilleTalon ( 540925 ) on Sunday May 08, 2016 @08:50AM (#52070255) Homepage
    In summary, buy my book for more bullshit.
  • by Anonymous Coward

    So this guy just invented a language that we already use "at a subconscious level"? How practical that there's no looking into the subconscious mind, so what it does is up to anybody's imagination. Can't he also invent Chomsky's "Universal Grammar" that we supposedly use at a subconscious level, but that nobody has ever been able to describe?

  • by ooloorie ( 4394035 ) on Sunday May 08, 2016 @09:30AM (#52070371)

    Did I miss the paper, or is the blog post everything there is? I remember the good old days when crackpot scientists at least went through the trouble of producing a scientific looking paper in LaTeX with lots of formulas and graphs.

    • Its in progress, and will be delivered in July. It says that right in the summary you illiterate moron. I guess you figured you would sound smart but that backfired. Good job.

      Next time, think before you post and save everyone time.

      • Its in progress, and will be delivered in July. It says that right in the summary you illiterate moron.

        Actually, what we can conclude from the summary is that not only is there no paper, the work isn't going to be peer reviewed either (because if this was a peer reviewed conference track, there would have to be a completed paper). Another sign of a crackpot.

        • So why comment? Did you mean to make this point earlier? If so, you should have made that point earlier.

          Were you being rhetorical in front of an audience that may not understand rhetoric? Stop it.

          Make a point, or don't ask a stupid question.

      • Its in progress, and will be delivered in July.

        Then report it in July.
        Until then, only the highest degree of skepticism is justified.

  • You only have to look as far as quantum physics to see how non universal this language is. The moment you make something "universal" is the moment your universe gets redefined.
  • Turing already did this back in 1936. It's called a "Turing Machine". See his essay on computable numbers: http://www.dna.caltech.edu/cou... [caltech.edu]

  • by Anonymous Coward

    We are looking for an entry level person with an Engineering, CS, Math or natural science degree with at least 2 years of SL programming, MS SQL, Java, Javascript, C/C++/C#, Oracle, DB2, Linux, Windows, OS X, AS400, AIX, RPG, COBOL, assembly: x86, 68000, PowerPC, IBM360, DEC.

    You must be passionate about your work.

    We are a dynamic fast paced organization.

    H1-bs Prefer....welcomed.

  • by Baldrson ( 78598 ) * on Sunday May 08, 2016 @09:45AM (#52070429) Homepage Journal

    Use Dirac notation [archive.org] as extended for big data by Robson in "The New Physician as Unwitting Quantum Mechanic: Is Adapting Dirac’s Inference System Best Practice for Personalized Medicine, Genomics, and Proteomics [researchgate.net]".

    This "notation" actually emphasizes certain primitive operations that can define the "machine language". Syntactic sugars should be used for parsimony, as well as and pragmas for efficient semantic heuristics are appropriate layers atop the primitives.

  • by Anonymous Coward

    That's nice, honey, you work on your universal language.

    Watch: This language will be a piss poor re-implementation of Common Lisp.

  • The claims about so-called 'mentalese' and Fodor here are pretty transparently bogus. Why is it that people so often like to talk about philosophy, which they clearly do not understand? So, this is yet another case of 'nothing to see here, please move along'.
  • . . . says "amateur".

  • Better catch him before he makes it to the Well World's interior and performs a full Reset of the Universe.

    ..on second thought, let's help him instead, I think the Universe could use a Reset.
  • Without a working and verified Grand Unifying Theory (GUT) in Physics, this cannot be done. And we are probably farther removed from achieving that than ever. This is, as presented, nothing but a scam, masking as Science.

  • can it decide if any simulation written in this language terminate in a finite time?

  • Does it involve an intricate mesh of nested brackets, braces and parenthesis?
    Mandatory tabbing and trailing semicolons?
    Conditions expressed by single punctuation makrs, which are reversed if the character appears twice?
    Variables, commands and functions chained together with periods?
    Does it support oodles of ways to disguise and execute destructive code?
    Am I going to have to repeatedly insist to my boss that just because I can replace a blown PSU that I'm not his man to code the website?

  • One could form an automata from the patterns of virtual particle interactions in the vacuum, however that is still going to be a virtual machine running an arbitrary language and not something running on the "bare metal" (or strings) of the universe and according to the fundamental rules that govern string interactions.

    When we see claims such as those made by George Mobus we need to consider if they are nothing more than a symptom of https://en.wikipedia.org/wiki/... [wikipedia.org]
  • Stephen wrote a grand proposal to compute physics with cellular automata. It builds on Von Neumans early work 70 years ago. Stephen never showed any really deep physics in this book, but says its coming.
  • I tried reading the article; it was pretty long and dense while failing to provide a tl';dr. Is he saying he's created yet another language that is Turing Equivalent? Is he saying he has creaeted a language that simulates physics by simulating fundamental behaviors? What is the accomplishment here?
  • How does this relate to Turing machines and Grand Unified Theories in physics? The former is well understood, solid theory in computer science. The latter is an unachieved goal of physics. Like many others here, my BS meter is in action; but I've got an open mind.

  • The open-source compiler for this new language is called Hokum and the free IDE is called Bunkum.
  • A long, text-only blog entry with merely "claims" that "I have done this amazing thing", is stupid.

    How did this garbage make the Main Page?

    Shall I write a FaceBook Post on the perpetual-motion machine that I invented, and built, but refuse to show anyone because they might steal my ideas? It would hold more water than this guy's incomprehensible gobbledygook.

  • The language is made of cat emoticons, some semi-transparent.

  • In LISP....with a couple of PERL scripts to tie it all together.

  • in their theoretical expressive power to describe any computable function. See Turing-Equivalent

    At least, all deterministic programming languages.

    Languages vary mostly in how compressed and/or comprehensible it is to express this versus that type of operation or type of datatype.

    I guess a machine-language for the universe would have to be expressive enough to take advantage of everything a quantum computer could do, whatever that set of capabilities actually is.

The most difficult thing in the world is to know how to do a thing and to watch someone else doing it wrong, without commenting. -- T.H. White

Working...