PtrMan PtrMan

Docs

Gaussian mixture models

nvflash download

Download lubuntu 14.04

switch (en) with (MyEnum) {
    case foo: ...
 case bar: ...

	#include <cassert>

	// the idea of this algorithm to have a bag like in nars with actions, the number of elements is limited globally (AIKR)
	// learned action sequences common between different tasks can be easily mined by just comparing the action sequences

	// after we did A with a propability we do B with another
	// A --> B

	typedef unsigned uint;
	typedef double PropabilityType;

	Principles of mind - are just jet another abstraction

	tick tock evolution

	Mutation mutation test test test
	all systems go
	and the mental limits fall

	#include <cstddef>

	// https://en.wikipedia.org/wiki/Three-valued_logic

	enum class EnumThreeValue {
	FALSE = 0,
	UNKNOWN,
	TRUE
	};

	# idea after the techniques used by ai one

	class HeapElement(object):
	def __init__(self):
	# needed?
	self.LeafData = None # if it is the leaf, then this is the leaf data (a boolean or a bit), else it can be none
	self.Left = None # if LeafData = None -> must be Index Of Heap Element
	self.Right = None # this is a bool or a char on the right side
	#self.NumberOfLeftBits = None # not needed?
	self.OccurrenceCounter = 0