Computer Science
Lieuwe Vinkhuijzen
  • Member for 5 years, 11 months
Profile Activity
Stats
4,156
reputation
105k
reached
69
answers
4
questions
About

Please message me if you have a short, elegant, funny or rhyming proof of something.

I'm a graduate student at Leiden University working on a thesis about quantum computing. The chapter about measurement is called Les Measurables.

What did the logician say to the politician who asked whether to put more or less logic in the curriculum? "Yes"

Communities (5)

Top network posts

This user doesn’t have any gold badges yet.
14
silver badges
23
bronze badges
View all badges

Top tags (81)

Score 99
Posts 24
Posts % 33
Score 55
Posts 8
Score 52
Posts 10
Score 35
Posts 8
Score 28
Posts 5
Score 24
Posts 5
View all tags →

Top posts (73)

All Questions Answers
Votes Newest
60 How can I explain to my parents that I study programming languages? May 1 '16
38 Is the halting problem decidable for pure programs on an ideal computer? Sep 13 '16
21 Would the P vs. NP problem become trivial as a result of the development of universal quantum computers? Apr 12 '17
19 Time complexity of addition Dec 30 '16
16 Will the future quantum computers use the binary, ternary or quaternary numeral system? Jun 2 '16
13 Does P=NP imply polynomial solutions to #P? Jun 1 '16
11 Literature about a naive approach to graph isomorphism by inspecting polynomials of adjacency matrices Nov 10 '16
8 What is the utility of proving P=NP if we can't find an algorithm that can solve any NP problem in polynomial time? Aug 15 '17
8 Why can't we exploite finiteness to prove incompleteness in NP? Sep 21 '16
7 Why are Chess, Mario, and Go not NP-complete? Feb 23 '17
View all questions and answers →

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.