Alan Turing submits On Computable Numbers for publication.
His proof shows that there can be no mechanical, general method (i.e., a Turing machine or a program in some equivalent model of computation) to determine whether algorithms halt. However, each individual instance of the halting problem has a definitive answer, which may or may not be practically computable.
@Moosader stack/heap differentiation and memory allocation in general. I'm tired of things that complexity-wise would run on a C64 bringing my modern r9 with 128 gigs of ram to it's knees O_x
🐍 aprxc — A #Python#CLI tool to approximate the number of distinct values in a file/iterable using the Chakraborty/Vinodchandran/Meel’s (‘coin flip’) #algorithm¹.
Are you looking for cutting-edge books 📚 on #technology and #computerscience? Then check out Leanpub, where our authors' ebooks are published and updated as they're being written on emerging trends and new developments, and tech that can change day-by-day
#kdtree and ball trees seem cool, but require full knowledge of the thing I'm searching for. What if it's 7 dimensional and I only know 4 of the values?
I feel like a "parallel kd tree" with a separate binary index on each dimension would work better here.
Reduce depth. Allow unspecified values. It'd also be a snap to create and search each dim in parallel.