Not with just this guide, with the combination of every possibly counter computation possible.
I’m pretty sure counters are turing complete (triggers definitely are), so technically, counters can replace block code (assuming no limitations like device placement, memory, and time, but because those limits exist, we can only replace blocks that revolve around computing problems. Tasks like adding a message to the activity feed would be impossible for counters given the limits that exist).
- Complex math is based (there is the problem of calculus–and other higher fields of mathematics–but you can solve some problems encountered in calculus using basic rules for solutions. An example is the power rule for derivatives which states: the derivative of a function ax^b is bax^(b-1) which you can translate into a bunch of counters to make the rule work; basic subtraction and multiplication) on simple math rules that are repeated many times and used in different sequences. A lot of math is just a bunch of rules and formulas that can be simplified and reconstructed into logic and basic arithmetic. There is the idea of variables out there in math, but that also has rules (solving ax + b = cx + d, simplifies to x = (b-d)/(c-a)) that can be broken down. Maybe not everything, but a great part.
- That has been figured out here.
- Technically, a counter is a property, or at least, can be. Because a counter can be a property, you can access a counter’s value to access a property’s value.
- Given enough memory and time, you could place a large number of counters that represent one large text device.
- A variable can be another property or a constant. Counters can act as reference properties in order to access the property. Accessing a counter-property from a list of counters can be thought of as memory. Each counter is a memory address with bits. We can access each counter by their address. A second list of counters/triggers can be updated to store the address and a sequence of triggers/counters handles the computation/transformation between the two lists that will extract a given counter-property given another counter-property. (I hope that makes sense…sorry for the bad explanation.)
In theory, counters can do it all, in practice, they can only go so far (triggers + counters = a much more powerful combination which gets us 85% to the finish line–beating block code).