We at @[email protected] are launching our very first & free open-source virtualization gathering in Germany, Mönchengladbach.

This new community event brings together everyone who’s passionate about open virtualization technologies, whether it’s Proxmox VE, XCP-ng, bhyve, Harvester, or any of the countless projects that make open infrastructure thrive. It’s about sharing experiences, learning from each other, and connecting with those who build and rely on open platforms every day.

We start the evening with two talks:

* "Enterprise-Ready? How people use Proxmox VE & Ceph" by Ronald Otto from Tuxis B.V.

* "BoxyBSD – Creating a free VPS hosting platform" by Florian Paul Azim Hoberg from credativ GmbH

Afterwards, the space opens up for discussion, networking, and casual chats. If you like to join with a talk, please feel free to reach out to me.

More details can be found here:
* https://gyptazy.com/open-source-virtualization-gathering-in-germany-monchengladbach/
* https://www.credativ.de/blog/aktuelles/open-source-virtualization-gathering-dezember-2025/
* https://www.meetup.com/de-DE/monchengladbach-oss-virtualization-gathering/events/311284475/

Tags: #meet #meetup #gathering #virtualization #virtualisation #container #kvm #proxmox #proxlb #xcpng #xen #bhyve #sylve #klee #kleene #incus #vmware #alternatives #opensource #free

@ki_und_koffein

Also .. die #Kleene kann auch menschenähnliche intelligente Verhaltensweisen zeigen, ist die jetzt auch ein IT-System?

#dogsOfMastodon

https://tube.undernet.uy/w/fAn5H5qF3eiC5qC3FRQewd

Saliendo a documentar los efectos de la lluvia veraniega || CC0-NC

PeerTube

Now I'm a big fan of refinement type. But they don't sit all that well with me because most examples I've seen could be manipulated into ADTs (read the previous post backwards).

Does anyone know of some work that does this manipulation? Or somehow sets some constraints on when you can't express a refinement types using 1,0,+,*, and mu (recursive) types?

Again, my suspicion is that it has to do with regular languages since 1,0,+,*,mu is a #Kleene algebra (right?)

HowTo: Kleene as a Container Management Platform for FreeBSD • gyptazy - The DevOps Geek

Kleene is a container management (jail manager) platform designed specifically for FreeBSD, bringing familiar concepts from Docker while fully embracing FreeBSDs native tools and philosophy. Instead of reinventing the wheel, Kleene follows the KISS (Keep It Simple, Stupid) principle, leveraging FreeBSD's built-in features to simplify application deployment, maintenance, and upgrades without unnecessary complexity or abstraction.

gyptazy - The DevOps Geek • DevOps, coding, cloud and open source in a geeky way.

#Docker alike container management on #FreeBSD? Let's have a look at #Kleene - which works very similar to Docker and makes the shift for Linux users even easier to #Jails without having deeper knowledge but by benefiting of all the features on Jails.

#klee #kleened #bsd #runbsd #linux #container #howto #devops #community #jails #freebsdjail #container #containerization #jailmanager #manager #jls

https://gyptazy.com/howto-kleene-as-a-container-management-platform-for-freebsd/

HowTo: Kleene as a Container Management Platform for FreeBSD • gyptazy - The DevOps Geek

Kleene is a container management (jail manager) platform designed specifically for FreeBSD, bringing familiar concepts from Docker while fully embracing FreeBSDs native tools and philosophy. Instead of reinventing the wheel, Kleene follows the KISS (Keep It Simple, Stupid) principle, leveraging FreeBSD's built-in features to simplify application deployment, maintenance, and upgrades without unnecessary complexity or abstraction.

gyptazy - The DevOps Geek • DevOps, coding, cloud and open source in a geeky way.
#Kleene's theorem: The set of regular languages, the set of NFA-recognizable languages, and the set of DFA-recognizable languages are all the same.
#Logic folks
In
R : φ1*φ2* ... *φn =0
R acts as logical
#kleene #godel #recursion
#Kleene was supposed to develop arithmetic from church numerals, he ended up finding that unlike succ n, church's lambda calculus has no notion for prev n.
His fix was to start the number line with pair 0,0 . With An extra 0, and map +1 the entire sequence S , to get a regular
#Kleene rosser found the logical paradox in the #lambdacalculus, #church was working at the time, when #godel lectured on incompleteness in ias - Princeton
#Haskell curry was doing almost same thing as church, under #Hilbert
syntactically substituting one formula in another
#Kleene's #recursive realizability proofs of intuitionistic arithmetic: recursive function f( proof of a formula expressing that recursive function "realizes", i.e. correctly instantiates the disjunctions) + existential quantifiers of the initial formula st formula gets true