I created a calculator only using the scripting commands in the video game Counter-Strike, bind (for input) echo (for output) and alias (for the logic). Bind is to connect keys to a command or string of specified commands, echo is to output text to the console, and alias is a command that allows you to create a new command out of a string of specified commands. Basically, I can do math without using math. This is pure connectionism, where there are no values, no logic operators and no measurements in the logic. It is purely making, breaking and using connections and nothing else.

The first few paragraphs from my paper that I am working on:

How To Compute Without Variables, Logic Operators or Measurements

Work in progress

I have come up with what I believe is a new type of logic, it is mechanical in nature, but because I could maybe see it done on the quantum level it could be far more complex than any mechanical machine has ever been, in ways not seen in physical mechanical devices.

This logic is pure connectionism, only using connections and nothing else. I look at it as a geometry of logic. My system performs the logic only using one command without numeric variables, without logic operators, and without measurements. This is neither digital nor analog logic.

This is not theory, I have built a working model using this logic that demonstrates if-then, do-while, a randomizer, a relational database and other logic, including a rudimentary calculator that adds/subtracts/multiplies/divides. In the working model I only use one command for hooking in the input, a few commands for output, but all the logic in between is one command that does nothing but link commands together.

The logic demonstrated in this model uses the command “alias”, which is used in a FPS video game called Counter-Strike, which is a modification for a video game made by Valve called Half-Life, which is based on id Software's QuakeWorld engine. This command is used to link various commands together creating a new command that executes a command string, to provide a way for customizing the interface of the game. This logic requires input and output provided in the game - which, no doubt, uses Boolean logic to perform, but the logic itself is contained to using the one command “alias” and does not use Boolean logic.

A readable-online version of the paper (no download, unless you want a Word copy)

You can also find the paper here, but you have to download it to read it:

I suggest you start with the simple version of the calculator that does just add and subtract:

And the complex calculator has much better inline commenting:

I am interested in taking some of the logic, perhaps the most complicated part - the grenade throwing script, and visually re-creating it in Minecraft. This part of the logic performs the permutations of a math question I came up with and was answered by using the ancient Chinese Pascal's Triangle in a new way. It is similar to the question of how many combinations of 4 hats on 4 pegs you can have, and I just had to count the pegs as part of the permutation where they did not.

Here is the question:

"You have a combination padlock with four dials on it. Each dial has the numbers 0 through 4 on them. The lock can have as many 0s as dials, and is set to 0000 by default. The lock does not allow you to use any number between 1 and 4 two or more times in the combination. The following combinations are valid: 0123 1234 0103 0010 4031. The following combinations are invalid: 0113 4014 0202 4444. How many possible combinations are there?"

The solution to this word problem is here, notice that it is a new use for Pascal’s Triangle, because it values nothing as something:

http://mathhelpforum.com/discrete-math/17147-combination-lock.html

I desperately need help writing the paper, it is obvious I never have written one before. I can't offer any money, because I plan to put this in the public domain. I will certainly give credit where credit is due, though. Please contact me at johnphantom@hotmail.com or the more reliable johnvlilley@gmail.com

Dani AI

Generated

This thread documents an unusual, working computation style built only from a single script-level linking/redefinition primitive. To make the idea useful and durable for readers who find this later, the submission needs three core things: a precise formal model, one or two minimal reproducible artifacts, and a clear demonstration of computational power or explicit bounds on what the model cannot do.

Suggested structure to add near the top of the paper or repo:

  • Short, concrete claim with exact definitions of terms used (for example, what is meant by "stateless" and "connectionism" here).
  • Related work summary (graph/term rewriting, combinatory calculi, small universal machines) that honestly positions novelty.
  • Formal model: syntax and operational semantics (names, link/rewrite operation, transition rules).
  • Constructions: minimal adder, conditional, a single-bit memory, and the calculator example reduced to a minimal test.
  • Proofs or simulations showing either universality or a provable upper bound.
  • Reproducibility section with step-by-step instructions, test vectors, and expected console output.

Concrete technical guidance and troubleshooting notes:

  • Formalize the implementation as a directed graph or a mapping from names to command-strings; treat the linking operation as a rewrite rule. That makes correctness statements and invariants provable.
  • To demonstrate power, give a small simulation that maps a known model (finite automaton, Minsky counter machine, or simple register machine) into the link-only model. If universality is claimed, a constructive simulation is the cleanest route.
  • Include automated tests: minimal inputs with expected outputs, cycle-detection checks, idempotence/invariant tests, and a small harness that logs each rewrite step for debugging.
  • Measure complexity in two simple metrics: number of rewrite steps to compute an output, and number of distinct names/links used.

Writing and publication tips:

  • Avoid overclaiming novelty; state limitations clearly. Add a short reproducibility checklist and a permissive license statement for the artifacts. The submission by contains working examples; the spam report from is noted but the technical material stands or falls on reproducible evidence and formalization.
Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.