Show more

So I'm trying to consider what framework to use for documentation at CleverThis (first document ill need to convert is the Spec for the concurrency I'm designing). These are the options I'm playing with and considering. Which do you like most, leave comments with suggestions and opinions.

Which program language would most excite you to want to contribute to an open-source project, all else being equal?

This was a really fun programming challenge originally proposed by @Absinthe I want to paste it here, along with my solution, so everyone who is interested can check it out.

Here is the link to his original post: qoto.org/@Absinthe/10289580109


Another Freebie...

This problem was asked by Facebook.

Given the mapping a = 1, b = 2, ... z = 26, and an encoded message, count the number of ways it can be decoded.

For example, the message '111' would give 3, since it could be decoded as 'aaa', 'ka', and 'ak'.

You can assume that the messages are decodable. For example, '001' is not allowed.

Here is the link to my solution: qoto.org/@freemo/1028986298217

My solution. This should be a somewhat space-optimized solution in ruby based off the modified concept of a Trie.

git.qoto.org/snippets/4

If i made this into a Radix Trie by compressing nodes with single children down I could reduce this further.

But since it does work I thought I'd share it as is. I'll update everyone if i decide to finish optimizing this particular solution.

It does however do a fairly decent job at compressing the tree by making sure no subtree is a duplicate of any other part of the tree (a node of any specific length/id will be the only node with that length.

For clarity I attached a picture from my notes of what the Trie would look like for the encoded string "12345" where the value inside each circle/node is the "length" value of that node, and the value attached to an arrow/vector/edge is the "chunk" associated with that link. The end result is any path from the minimum node (0) to the maximum node (5). This diagram does not include incomplete paths which my program does right now.

Incomplete paths can also be trimmed to further reduce the space. But since incomplete paths each add only a single leaf node to the tree, and might be useful for various use cases I decided to keep it.

In case anyone is interested here is a link to a very difficult logic puzzle that anyone without math skills can solve (it is easy to understand though). I also include the answer with a CW for those who want to skip right to the answer.

Question: qoto.org/@freemo/1026715554682

Answer: qoto.org/@freemo/1027664501348

The Discourse server now has support for rendering Latex style psuedocode in posts.

Check out this post I just made explaining an algorithm I invented some years back. It includes the java code, psuedocode, and full text explanation.

I will do a seperate post soon explaining how to use the psuedocode in posts.

discourse.qoto.org/t/hyperasso

So far on we have brought the following services up, I want to know what you want to see next. All of these services are free and open to the public for open-source and collaborative non-commercial ventures.

Here is what we have up so far:

Modified server - qoto.org

server - cloud.qoto.org

GitLab server - git.qoto.org

Servers we intend to bring up:

Let me know which of the above you'd like to see next. Also if you have a suggestion of a service we didnt list let me know and we might just host it for you if it would be useful for others.

We now have two more Federated services up on Qoto. They are still in beta so use at your own risk.

NextCloud: cloud.qoto.org
Gitlab: git.qoto.org

Feel free to sign up for an account and use the services. Let me know if you have any trouble using it.

Big things happening at I wanted to update everyone on.

So as most of you know I had a year long back injury that put a lot of QOTO plans on hold. But I've been healed and working on bringing much of that vision to reality.

As of a few weeks ago a few close friends and fellow engineers wanted to join the team. I am currently sitting with 3 other new engineers and we are working on bringing up several instances including peertube, nextcloud, gitlab, discourse, and of course a newer version of QOTO. A full collaboration suite for others in STEM and the open-source community. All for free to its users.

This launch will coincide with several of my other projects many of you follow including protowaffle, ROES, Graphactor, Aparapi, Ferma and many others. We will host all the source on QOTO as well as make it the source for future software announcements related to those products.

Stay tuned for me.

To help some of the newcomers make connections: name 5-7 things that interest as tags so they are searchable. Then boost this post or repeat its instructions so others know to do the same. Add to the post.















Just finished revamping the coloring system and the descriptions of rooms displayed when you enter a new room or look around in Aethyr

Screenshot attached.

Some general info:

The game is called Aethyr and it is open-source :opensource: and written in Java :java:

You can find the source code here: github.com/Syncleus/AetherMUD

I did a little prototyping on a new layout for my game's character info. Not nearly complete (doesnt show most of the stats yet) but thought I'd share anyway. It at least gives an idea as to the direction im heading in on visualizing some of this stuff with just ASCII.

Some general info:

The game is called AetherMud and it is open-source :opensource: and written in Java :java:

You can find the source code here: github.com/Syncleus/AetherMUD

Woot! With my latest commit I have officially converted 100% of the codebase to be backed by (meaning any GraphDB, specifically OrientDB in this case). The old system was to just store it as raw JSON on the file system.

AetherMUD is Open-source :opensource: written in Java :java:

It is an MMORPG, text based, and played through telnet/ssh. More info here:

github.com/Syncleus/AetherMUD/

So I started working on my text based MMORPG again last night (referred to as MUDs). I am going to convert the world data from JSON text yo using a graph database through. instead. The world is the only thing left to convert, items spawns and character data was already converted. After that I'll work on getting the fight dynamics to where I want it.

The game is called AetherMud and it is open-source :opensource: and written in Java :java:

You can find the source code here: github.com/Syncleus/AetherMUD

"To help some of the newcomers make connections: name 5-7 things that interest you but aren't in your profile, as tags so they are searchable. Then boost this post or repeat its instructions so others know to do the same.""To help some of the newcomers"















Been coding up a MUD in my free time for fun. This is a screen shot of the local map I coded up that shows rooms, exits, enemies, and NPCs; all done using ASCII characters. Written in Java.

github.com/Syncleus/AetherMUD

Adapted my primality test algorithm to do a check for if a number is a "Perfect Number" (the sum of all its dividends equals the number itself). This one was fun and turned out to be super fast as well. It was written in Haskell.

Show more
Qoto Mastodon

QOTO: Question Others to Teach Ourselves
An inclusive, Academic Freedom, instance
All cultures welcome.
Hate speech and harassment strictly forbidden.