theory salon

« first day (269 days earlier) ← previous day next day → last day (3360 days later) »

vzn

01:09

that P=?NP Programming Puzzles & Code Golf question has some joke answers, but there are some other serious ones, incl a remarkable one on QM adiabatic computing using a mathematica library by an undergrad student at moscow state U. impressive!

A: So obviously, P = NP

Mathematica + Quantum Computing You may not know that Mathematica comes with quantum computer aboard Needs["Quantum`Computing`"]; Quantum Adiabatic Commputing encodes a problem to be solved in a Hamiltonian (energy operator) in such way that its state of minimum energy ("ground state") repres...

there was also wide enthusiasm for the challenge with over 70v as the question basically went viral.

so then had a crazy idea (arent they all) that maybe this group could be utilized as a collective brain for research programs...

leading to this 1st cut, not knowing what to expect.

-2

Q: boolean circuits/expression induction via visualization

this is a proposal, hopefully first in a series (depending on reception), that will explore boolean circuits, empirical research, visualization, reverse engineering, and advanced (T)CS, and possibly even have some real research value. it is different that other proposals on this site in distinct ...

the comments on post & in chat showed respondents didnt really have any idea what it was sketching out; some of them have high rep on the site... some even list their ages in profiles as young, ie high school age.

so, closed in 30m... :( ... but did get fairly good feedback/steering.

TimWolla, Germany

913 3 18

code-golf code-challenge algorithm brainfuck cryptography game popularity-contest

TheDoctor, Somewhere inside my TARDIS

2.9k 1 12 37

Peter Taylor

11.8k 1 13 47

code-golf code-challenge math number algorithm string sequence

Doorknob, Texas

11.9k 2 24 85

steveverrill, Madrid, Spain

1.6k 2 12

spking of real talent, doorknob lists his age as 13 & has ~12k on the site very impressive ...

anyway take2...

Q: building circuit for divisibility by 3

this is related to another recent question but will not ref it directly just to wipe the slate clean. a boolean circuit in TCS is basically a DAG consisting of And, Or, Not gates, and by what is known is "functional completeness" they can compute all possible functions. eg this is the basic pri...

code-challenge popularity-contest graphical-output combinatorics

13 hours later…

Ilya_Gazman

14:15

Q: Racing java.util.Collections.sort

I found a more efficient sort algorithm with average and best performance of O(N), and worst performance of O(N Log(N)). On random data. I need your help to tell me if my tests is correct, and my biggest question is: How can I test it on real world data? This question going to have five parts: ...