模倣子 Complete Matrix Set of Triangular Baseball

Memetic Index

Introduction 

I've been trying for weeks to write down all of the transitions possible in the Triangular Baseball System. I've been drawing transition diagrams, and I've made some breakthroughs, but it's still proving a bit unwieldy to make sure I'm not missing any transitions.

My approach has been to start with each of the terminal states, S0 (no one on base, BasesOpen), S1 (man on first, OnFirst), S2 (man on second, OnSecond), and S3 (bases loaded, Loaded) and follow them through all of the possible transitions until each branch ends with another terminal state. This has proven much more fruitful than trying to delineate all of the transitions between any two terminal states, for instance (which was my previous strategy). It's hard to check that all transitions have been written down, and it's a bit unwieldy doing it with a transition diagram as the point of departure, in terms of drawing it and fitting everything in.

In the end what I found is that writing down all of the deployment descriptors, focusing on the deployments of "the field" as being immunomemetic and/or alliance deployments which enable other deployments, to be away of exhausting the possibilities. Then once I had all the internal states I needed, I could create the transition matrix sets and diagrams. Consistent with experience so far, starting from the deployment descriptors seems to be the most fruitful and clear-cut way to go.

My motivation is to demonstrate that it is possible to exhaustively map the Transition Matrix Set (2) for a simple, well-understood system, and to show what that looks like. The next step is to apply it to less well-understood systems, specifically my other project of Chess as a memetic model of two societies in conflict (3).

The Deployment Descriptor Approach 

An insight I had recently is that the equal sign is relevant in deployment descriptors, and is different to the "=>" symbol which I have been using. StateA.memelist! => StateB refers to deploying a bunch of memes, memelist!, while in state StateA results in transition to StateB. I have also been using just memelist! => StateB in cases where the current state is implied, or memelist! is perhaps a kind of shorthand, or uses parameters or lists [ agentX,meme1!, meme2!,..., memeN! ] which may have only local meanings. However, if all memes and starting and ending states are fully specified, StateA.memelist! is equivalent to StateB, so I can write StateA.memelist! = StateB. We could even posit notation such as StateA = StateB.(-memelist!) or (StateB - StateA) = memelist! It's unclear how useful such things might be at this point, however.

Transitions from S0 (BasesOpen) 

Here's what a transition diagram looks like for all plays starting from BasesOpen (S0).

fig. 0.1. State Transition Diagram for S0 (BasesOpen)

Here are the deployment descriptors for all paths starting from BasesOpen (S0) and proceeding to a terminal state.

(1) BasesOpen.hit!batter.first! => A   "No one on base, batter runs to first"

(2) A.field.first!batter.out! => BasesOpen   "batter out on first"
(3) A.field.second!batter.safe!(first) => OnFirst "ball at second, batter stops at first"
(4) A.batter.second! => B "batter passes first and is clear to go to second"

(5) B.field.second!batter.out! => BasesOpen  "batter tagged out at second"
(6) B.field.home!batter.safe!(second) => OnSecond "ball at home, batter stops at second"
(7) B.batter.home! => C "batter runs for home"

(8) C.field.home!batter.out! => BasesOpen  "ball thrown home, batter tagged out"
(9) C.batter.safe!(home) => BasesOpen  "batter scores a run"

fig 0.2. Deployment Descriptors Starting from BasesOpen (S0)

The point here is that at every state there is an opportunity for the fielding team to take action. BasesOpen (S0) is the simplest state, only one runner, nobody on base yet. The fielding team can throw the ball to any of the bases, or effectively be "in the process," giving the runners a chance to move freely.

There are a couple of ways to think about this. In steps (4), (7), and (9), the batter is taking action, deploying a meme without the fielding team doing anything. We could imagine saying that the fielding teams is in fact deploying a meme, that is, "an error," or field.error! or (9) C.field.error!batter.safe!(home). We can also notice that in all the other deployments, that is, where the field is doing something, it looks like an immunomemetic deployment or an alliance deployment where the action of the batting team is compelled or enabled by the fielding team. Here we note again that immunomemetic notation and alliance notation are homologous. The sociological implications of this may be far-reaching, but that may be for another time.

To be clear, states A, B, and C are "transitional states." The game cannot stop at those states--they must continue on to a terminal state. They are not really "compelled states," per se (1), but the immunomemetic and alliance deployments, that is, the combined memetic deployments, such as (8) C.field.home!batter.out! do represent a compelled state, that is, one where one agent has no choice but to deploy a given meme (or set of memes). A "long form" could look like:

(8) C.field.home! => C-Hidden.batter.out! => BasesOpen

So we see how the batter has no freedom of choice, and that this is part and parcel of an immunomemetic deployment (or an alliance deployment), and thus we employ the immunomemetic notation of combined memes. We'll discuss how this looks in terms of the Transition Matrix Subset for S0 (BasesOpen) below.

The idea is that if the fielding team does not get the ball to any relevant positions, either forcing the runner out or forcing him to stay put, such as (2) and (3), the runner is then free to exercise whatever other options there may be, e.g., keep running, as in (4). This is essentially just another compelled state where the runner has an open base coming up next, and thus has nothing better to do than to run for it, even though he may get tagged out in the end.

Here's the Transition Matrix Subset for S0 (BasesOpen). I call it a "subset" because it is not a complete representation of all state transitions of the triangular baseball system, but only those that begin at the S0 state. Elaborating a set of matrices for all four start states, S0, S1, S2, S3, and then renaming the states in each of those matrix sets to SO-A, SO-B, and so forth, would constitute a complete Transition Matrix Set for the Triangular Baseball Memeplex.

no one on base, batter runs to first

S0		agents
		field	batter
m e m e s	hit!first!		A

no one on base, batter runs to first

A		agents
		field	batter
m e m e s	first!	batter.out! => BasesOpen
	second!	batter.safe!(first) => OnFirst	B
	home!
	safe!( )
	out!

batter rounds first, clear to run to second

B		agents
		field	batter
m e m e s	first!
	second!	batter.out! => BasesOpen
	home!	batter.safe!(second) => OnSecond	C
	safe!( )
	out!

batter runs for home

C		agents
		field	batter
m e m e s	first!
	second!
	home!	batter.out! => BasesOpen
	safe!( )		BasesOpen
	out!

fig. 0.3. Transition Matrix (Sub)Set for BasesOpen (S0)

A Note on Compelled States and Transition Matrixes 

The classic image of a transition matrix in a transition matrix set, or a transition diagram or deployment descriptor is StartState.agent1.meme1! => NewState. If we look at matrix C in the BasesOpen transition matrix subset (fig. 0.3.) we see that when the batter deploys safe! we go to BasesOpen, i.e., the only entry in that node in the matrix is the state itself. However, when the field deploys home!, the batter is out before the system ends up in BasesOpen. In other words, the batter is forced to deploy out! This is by definition a compelled state, i.e., the batter has no choice in deploying it. In that sense we have a shorthand. We could just as well depict a different version of Matrix C, C' and add another matrix, C'' where all that goes on is that the batter has to deploy out! and so we'd call that a compelled state matrix. In a state transition diagram that would be a "cloud" with only one arrow coming in and only one going out, i.e., no choice.

batter runs for home

C'		agents
		field	batter
m e m e s	first!
	second!
	home!	C''
	safe!( )		BasesOpen
	out!

batter is compelled out

C''		agents
		field	batter
m e m e s	first!
	second!
	home!
	safe!( )
	out!		BasesOpen

fig. 0.3.1. Break-Out of Compelled State Matrix for BasesOpen (S0)

Here we see how we have an extra matrix in which nothing interesting happens except that the batter always gets out and the system proceeds to BasesOpen. This is a compelled state matrix for that reason. Note that the probability weighting on the single entry in the compelled state matix is, obviously, 100%. It's the only thing that can possibly happen. The original configuration of Matrix C (figs. 0.2. and 0.3.) is a "shorthand". As a computational representation of the system, fig. 03.1. is probably a better, more consistent way to go.

Transitions from OnFirst (S1)  

Carrying on from the foregoing, we try a more complex example. Here we have two runners, so two agents making somewhat independent decisions. Here we see how if the field gets one runner out, the other is effectively guaranteed to be safe somewhere else.

Deployment Descriptors for S1 (OnFirst) 

OnFirst.hit!batter.first! => A

A.field.first!first.safe!(first)batter.out! => OnFirst 
A.field.second!first.safe!(first).batter.out! => OnFirst
A.first.second! => B

"batter running to first, first base runs to second"
B.field.first!batter.out!first.home! => C
B.field.second!first.out!batter.safe!(first) => OnFirst
B.field.home!first.safe!(second) => C1
B.first.home! => D

"batter out, first running towards home"
C.field.home!first.out! => BasesOpen
C.first.safe!(home) => BasesOpen

"first safe at second, batter still running to first"
C1.batter.safe!(first) => Loaded
C1.field.first!batter.out! => OnSecond

"batter still running towards first, first running to home"
D.field.first!batter.out!first.safe!(home) => BasesOpen
D.field.second!batter.safe!(first)first.safe!(home) => OnFirst
D.field.home!first.out!batter.second! => E    "runner is compelled by open base"
D.first.safe!(home)batter.second! => E

"first base runner out/safe, batter rounding second"
E.field.second!batter.out! => BasesOpen
E.field.home!batter.safe!(second) => OnSecond
E.batter.home! => F

"batter running for home"
F.field.home!batter.out! => BasesOpen
F.batter.safe!(home) => BasesOpen

fig. 1.1. Deployment Descriptors for S1

fig. 1.2. Transition diagram for S1

Transition Matrix (sub)Set for S1 

no one on base, batter runs to first

S1		agents
		field	batter
m e m e s	hit!first!		A

"batter running to first"

A		agents
		field	batter	first
m e m e s	first!	first.safe!(first)batter.out! => OnFirst
	second!	first.safe(first).batter.out! => OnFirst		B
	home!
	safe!( )
	out!

batter running to first, first base runs to second

B		agents
		field	batter	first
m e m e s	first!	batter.out!first.home! => C
	second!	first.out!batter.safe!(first) => OnFirst
	home!	first.safe!(second) => C1		D
	safe!( )
	out!

batter out, first running towards home

C		agents
		field	batter	first
m e m e s	first!
	second!
	home!	first.out! => BasesOpen
	safe!( )			(home) BasesOpen
	out!

first safe on second, batter still running to first

C1		agents
		field	batter	first
m e m e s	first!	batter.out! => OnSecond
	second!
	home!
	safe!( )		(first) Loaded
	out!

batter still rounding first, first running home

D		agents
		field	batter	first
ba e m e s	first!	batter.out!first.safe!(home) => BasesOpen
	second!	batter.safe!(first)first.safe!(home) => OnFirst
	home!	first.out!batter.second! => E
	safe!( )			(home) batter.second! => E
	out!

first base runner out/safe, batter runs to second

E		agents
		field	batter	first
m e m e s	first!
	second!	batter.out! => BasesOpen
	home!	batter.safe!(second) => OnSecond	F
	safe!( )
	out!

batter running home

F		agents
		field	batter	first
m e m e s	first!
	second!
	home!	batter.out! => BasesOpen
	safe!( )		(home) BasesOpen
	out!

fig. 1.3. Transition Matrix Subset for S1

Transitions from OnSecond (S2) 

I'm going to try to lay out the same stuff for the starting state where one runner is on second base. I'll list all of the deployment descriptors, which is always a good place to start, and then I'll build the Transition Matric Set for it. Finally, I'll try to draw a transition diagram for it, which should be possible for this size of submemeplex.

The Deployment Descriptor List for OnSecond

The first thing that happens is that the batter gets a good hit and starts running to first base, which is unoccupied, hence no forced out this time. I need to make sure I can get back to all states, including S1 (OnFirst). Except for S0, all states can make it to all other states.

"at bat - compelled state waiting for a hit"

OnSecond.hit!batter.first! => A

"batter running to first"

A.field.first!batter.out!second.home! => B

A.field.second!second.safe!(second) => C

A.field.home!second.safe!(second) => C

A.second.home! => A1

"second running home, batter rounding first"
A1.batter.second! => A2

A1.field.first!batter.out! => B

A1.field.second!batter.safe!(first) => E

"batter running to second, second running home"
A2.field.second!batter.out! => B

A2.field.home!second.out!batter.safe!(second) => OnSecond

A2.second.safe!(home)batter.home! => D

"batter out, second running home"

B.field.home!second.out! => BasesOpen

B.second.safe!(home) => BasesOpen

"second safe on second, batter running to first"

C.batter.safe!(first) => Loaded
C.field.first!batter.out! => OnSecond

"second out/safe at home, batter running home"

D.field.home!batter.out! => BasesOpen

D.batter.safe!(home) => BasesOpen

"batter safe on first, second running home"

E.field.home!second.out! => OnFirst

E.second.safe!(home) => OnFirst

fig. 2.1. Deployment Descriptors for S2

Just one observation: this set of deployment descriptors seems simpler, or more self-referential than the one for S1. It seems like it might be missing the scenario where the second base runner gets hung up and the batter is obliged to hold up. The two are more independent, for one thing, the batter will not get out simply because the second base runner can't run home, which would be the case in OnFirst (S1). 

fig. 2.2. Transition Diagram for S2 (OnSecond)

The Transition Matrix Set for OnSecond (S2) 

no one on base, batter runs to first

S2		agents
		field	batter
m e m e s	hit!first!		A

"batter running to first"

A		agents
		field	batter	second
m e m e s	first!	batter.out!second.home! => B
	second!	second.safe!(second) => C
	home!	second.safe!(second) => C		A1
	safe!( )
	out!

"second running home, batter rounding first"

A1		agents
		field	batter	second
m e m e s	first!	batter.out! => B
	second!	batter.safe!(first) => E	A2
	home!
	safe!( )
	out!

"batter running to second, second running home"

A2		agents
		field	batter	second
m e m e s	first!
	second!	batter.out! => B
	home!	second.out!batter.safe!(second) => OnSecond
	safe!( )			(home) batter.home! => D
	out!

"batter out/safe, second running"

B		agents
		field	batter	second
m e m e s	first!
	second!
	home!	second.out! => BasesOpen
	safe!( )			(home) BasesOpen
	out!

"second safe on second, batter running to first"

C		agents
		field	batter	second
m e m e s	first!	batter.out! => OnSecond
	second!
	home!
	safe!( )		(first) Loaded
	out!

"second out/safe at home, batter running home"

D		agents
		field	batter	second
m e m e s	first!
	second!
	home!	batter.out!=> BasesOpen
	safe!( )		(home) BasesOpen
	out!

"batter safe on first, second running home"

E		agents
		field	batter	second
m e m e s	first!
	second!
	home!	second.out!=> BasesOpen
	safe!( )			(home) BasesOpen
	out!

fig. 2.3. Transition Matrix Subset for S2 (OnSecond)

Transitions for Bases Loaded (Loaded, S3) 

Deployment Descriptor List for Loaded Bases (S3) 

Loaded.hit!batter.first! => A

"batter running to first"

A.field.first!batter.out!second.home! => B

A.field.second!second.safe!(second)first.safe!(first)batter.out! => Loaded

A.field.home!second.safe!(second)first.safe!(first)batter.out! => Loaded

A.second.home! => A1

"second running home, first on first, batter running to first"

A1.field.first!batter.out!first.safe!(first)second.safe!(home) => OnFirst

A1.field.second!first.safe!(first)batter.out!second.safe!(home) => OnFirst

A1.field.home!second.out!first.second! => A2 

A1.second.safe!(home)first.second! => A2

"second safe/out home, first running to second, batter to first"

A2.field.first!batter.out!first.home! => E

A2.field.second!first.out!batter.safe!(first) => OnFirst

A2.field.home!first.safe!(second)batter.safe!(first) => Loaded

A2.first.home!batter.second! => C    "kind of independent"

"batter out, ball at first, second running home"

B.field.first!first.safe!(first)second.safe!(home) => OnFirst

B.field.second!first.safe!(first)second.safe!(home) => OnFirst

B.field.home!second.out!first.second! => D

B.second.safe!(home)first.second! => D

"second out/safe, first to home, batter to second"

C.field.second!first.safe!(home)batter.out! => BasesOpen

C.field.home!first.out!batter.safe!(second) => OnSecond

C.first.safe!(home)batter.home! => F

"everybody else out/safe, first running to second"

D.field.second!first.out! => BasesOpen

D.field.home!first.safe!(second) => OnSecond

D.first.home! => E

"first on the way home"

E.field.home!first.out! => BasesOpen

E.first.safe!(home) => BasesOpen

"batter running home"

F.field.home!batter.out! => BasesOpen

F.batter.safe!(home) => BasesOpen

fig. 3.1. Deployment Descriptors for S3 (Loaded)

fig. 3.2. Transition Diagram for S3 (Loaded)

Transition Matrix Set for Bases Loaded (S3)

no one on base, batter runs to first

S3		agents
		field	batter
m e m e s	hit!first!		A

"batter running to first"

A		agents
		field	batter	first	second
m e m e s	first!	batter.out!second.home! => B
	second!	second.safe!(second)first.safe!(first)batter.out! => Loaded
	home!	second.safe!(second)first.safe!(first)batter.out! => Loaded			A1
	safe!( )
	out!

"second to home, first on first, batter running to first"

A1		agents
		field	batter	first	second
m e m e s	first!	batter.out!first.safe!(first)second.safe!(home) => OnFirst
	second!	first.safe!(first)batter.out!second.safe!(home) => OnFirst
	home!	first.safe!(second)batter.safe!(first) => Loaded
	safe!( )				(home) first..second! => A2
	out!

"second safe/out, first to second, batter to first"

A2		agents
		field	batter	first	second
m e m e s	first!	batter.out!(first.home! => E
	second!	first.out!batter.safe!(first) => OnFirst
	home!	first.safe!(second)batter.safe!(first) => Loaded		batter.second! => C
	safe!( )
	out!

"batter out, ball at first, second running home"

B		agents
		field	batter	first	second
m e m e s	first!	first.safe!(first)second.safe!(home) => OnFirst
	second!	first.safe!(first)second.safe!(home) => OnFirst
	home!	second.out!first.second! => D
	safe!( )				(home) first.second! => D
	out!

"second out/safe, first to home, batter to second"

C		agents
		field	batter	first	second
m e m e s	first!
	second!	first.safe!(home)batter.out! => BasesOpen
	home!	first.out!batter.safe!(second) => OnSecond
	safe!( )			(home) batter.home! => F
	out!

"first runs to second, all others out/safe"

D		agents
		field	batter	first	second
m e m e s	first!
	second!	first.out! => BasesOpen
	home!	first.safe!(second) => OnSecond		E
	safe!( )
	out!

"first on the way home"

E		agents
		field	batter	first	second
m e m e s	first!
	second!
	home!	first.out! => BasesOpen
	safe!( )			(home) BasesOpen
	out!

"batter running home"

F		agents
		field	batter	first	second
m e m e s	first!
	second!
	home!	batter.out! => BasesOpen
	safe!( )		(home) BasesOpen
	out!

fig. 3.3. Transition Matrix Subset for S3 (Loaded)

Summary, Conclusions, and Future Work 

One thing I want to do, having completed this what I hope is a rigorous description of the triangle baseball model, is to pose probabilistic questions to the model. Simple things like how likely is it to get a grand slam, given bases loaded, for example.

One example is how each filled box in the transition matrix set would have a weight. Hence, once we work out the memetic sequences (appended deployment descriptors) for, say, a Grand Slam, we could then apply weights (probabilities) to each deployment, and then work out the likelihood of a successful event deployment, given the weighting. Things of that nature.

I also hope to move on to modeling a system like chess, where each side represents a memeplex, like two societies in competition. The pieces would be agents and together they would decide the best move. Some kind of system of voting, rather, the way that agents decide which meme to deploy and so on, would be needed. Also, systems could vary along lines such as whether some pieces have more influence than others, can we implement memetic hub (nexus) structures, and so on.

My hope is that I have demonstrated that my notational systems (deployment descriptors, transition diagrams, and transition matrix sets) are equal to the task of thoroughly specifying the behavior of a system. This demonstrates it as a valuable notational tool, and also as a system for building a grammar which may be uploaded into a computer system for similation and other purposes.
_______________________________
FOOTNOTES

(1) See glossary for discussion of transitional, virtual, hidden, and compelled states.

(2) The Transition Matrix Set is a property object of a memeplex that describes how the memes and agents in the memeplex cause transitions between the various states of said memeplex. In this essay, I'm attacking the Transition Matrix Subsets of the triangle baseball memeplex, that is, I'm starting from each of the four states -- S0, BasesOpen; S1, OnFirst; S2, OnSecond; and S3, Loaded -- and following each series of transition states pertinent to the given subset through to one of the other terminal states.

(3) I want to use the game of chess as a model for two societies, read, memeplexes, in competition. Chess is a familiar system to many people, with a variety of pieces which could be used as the anchors for a heterogeneous collection of deployment opportunities, memetic nexuses (4), and so forth. One idea is to be able to "download" a given memeplex into one side or the other, and see how it plays out against another memeplex.

(4) I am also considering the term "memetic hub" for memetic nexus, since it may be more accessible.

漫画 Misfits Meeting July Potluck

 Manga Index

模倣子 Religion Controls the Memetic Big Other

 

Memetic Glossary 

It may be true that human beings are memetically predisposed to, or are even "forced" to, sense the presence of a "Big Other," which could be loosely described as "what (all) other people think of me," or more to the point, "what will other people (as well as I can guess) do in response to any of my own possible hypothetical actions or inactions?" The (macro)memetic take is that this is all that humans really do, all the time, i.e., strategize our place in society, our action-response relation to others. If one does not accept that basic macromemetic premise, then the following may make little sense, but here goes... We can each model about two hundred other individuals (Dunbar number) in our brains, which allows us to control the anxiety to do with those relationships, and after that it's just "Society" that confronts us. Religion, i.e., a codified set of beliefs and "laws" and a narrative, a story, about our, and our people's, relationship to a God, or gods, or the metaphysical explanation of what supposedly lies behind the natural world, may be less like the project of Science, i.e., to "understand" the world, ultimately to provide useful source material for endeavors such as Engineering and Public Policy which seek to construct complex systems that actually "work" or solve problems in the material world, and more one of bridling, controlling the scope and power of, systematizing, attaching well-marked, well-closed memeplexes to, this innate, inchoate-yet-overwhelming sense of a Big Other that all humans feel as a direct result of our nature as meme-exchanging beings, or innate drive and need to socialize. So if this line of reasoning is true, then the creation of religion with all its minutia and mythology and arbitrariness, and ultimate metaphysical irrationality and disconnect from the vision of scientific inquiry might be seen as a kind of "we HAVE to build a nuclear fission bomb NOW so that nobody build a hydrogen bomb later." Probably a really bad analogy, and I would welcome anybody's coming up with a better one. Religions are obviously memeplexes, and behave like large systems of viruses. But religions competing with one another? What does that look like, memetically? It seems to have a lot to do with things like "who has the coolest hats?" but it's probably to do with which solves the roping in the Big Other problem most efficiently and other such. With memeplexes, it's often the ones with the most outward complexity, but which below the surface have the most economical memetic transactions, and this usually has to do with how well-marked and well-closed the memes in question are, and also the effectiveness of the pairing between "logical" and "illogical" memes. Religions don't have to be rational or logical (duh) but it's still a good idea to occasionally pair the nutty dogma with stuff that actually works.

Great Women Who Should Be on YOUR $20

 Here's another one, showing that computer science was not only deeply influenced by women, it was practically invented by women (and Alan Turing, who was gay, by the way): Ada Lovelace. I think the language "Ada", which I've heard looks a lot like PL/SQL (near and dear to my heart) is named after her. Other great female candidates for the $20 are in this article.

Here's a link to the original post.

---

Here are some other candidates to be on the $20 bill, or other units of currency (almost all are Americans)

Edith Clarke, mathematician, electric power pioneer
Cecillia Payne, discovered how stars work
Annie Bell, compiled data for Cecillia Payne
Marie Tharp, discovered continental drift
Rosalind Franklin, x-ray crystalography critical to discovery of DNA
Grace Hopper, inventor of COBOL, computer science pioneer
Radia Perlman, RSTP, etc., "The mother of the Internet"
Bella Abzug, Mayor of New York
Golda Meir, 4th prime minister of Israel
Catherine the Great, architect of Modern Russia

Emmy Noether, the most important woman in mathematics (c.f., Einstein, et al), relation between conservation laws and symmetry and oh, so much more
Marie Curie, discoverer of radioactivity
Lise Meitner, first to explain nuclear fission, 109th element "Meitnerium", director at Kaiser Wilhelm Institute
Murasaki Shikibu, authoress of the world's oldest novel, The Tale of Genji

So, for starters, the Internet, the world's most popular computing language (through the 90s anyway), some of the most important phenomena that make our world work which we didn't understand AT ALL before: continental drift, that stars are made of mostly hydrogen, how they work, etc., what radioactivity is, how nuclear fission works, the idea that fields and particles can produce our reality, and what DNA is and how it's structured, and don't let's forget transmitting power over long distances with electricity, among many other things, were ALL the accomplishments of WOMEN. 

I wrote another little piece on great women of our time.

漫画 Misfits Meeting Potluck TOMORROW

Manga Index

漫画 Start Draw Every Day for a Year

Manga Index 

I should be back from Blaze's wedding on the 15th of June, 2023.

Let's see if I can keep it up for a year! Like I did with my comics for something like five years.