324 reputation
18
bio website vzn1.wordpress.com
location U.S.
age
visits member for 1 years, 7 months
seen 2 hours ago

The algorithm designer who does not run experiments risks becoming lost in abstraction. —Sedgewick


Apr
17
comment Application of computers in higher mathematics
see eg following related essays with many leads/refs/se Q/As, great moments in empirical/experimental math & adventures/commotions in automated theorem proving. the main challenge of computerized math intelligence is undecidability (discovery dating to Godel) but it is not inconceivable there could be major advances
Apr
8
comment Are mathematical articles on Wikipedia reliable?
see also elementary mathematics on wikipedia by prof Riskin with similar biting criticism
Apr
8
comment Are mathematical articles on Wikipedia reliable?
they might be generally reliable but are they understandable? unf a case can be made that style is challenging in collaboratively edited documents, and imho many wikipedia math articles often tend to be difficult to follow compared to similar book accts based on minimal exposition and heavy technical/formal emphasis.... & feel they tend not to define math terms well before using them etc.... many misc/prominent issues related to comprehensibility! similar complaints on misc net forums eg reddit
Apr
1
comment algorithm for traversing a fractal in a “maximally ordered” way
addendum: this might be related to pathfinding algorithms eg A*. have they been applied to fractal traversal? (theres a lot of recent research on online versions also)
Apr
1
asked algorithm for traversing a fractal in a “maximally ordered” way
Mar
28
answered “Simple” beautiful math proof
Mar
27
awarded  Editor
Mar
27
revised Interesting mathematical problems for 1st year university students
added 5 characters in body
Mar
27
answered Interesting mathematical problems for 1st year university students
Mar
19
comment Is a brute force method considered a proof?
lots of examples/refs on recent empirical/experimental math/TCS research
Feb
21
revised looking for hypergraph decompositions
edited tags
Feb
21
awarded  Tumbleweed
Feb
18
comment Solving P vs NP with computer
see also empirical/experimental TCS research & SAT induction idea
Feb
14
asked looking for hypergraph decompositions
Feb
13
comment Why are mathematical proofs that rely on computers controversial?
some analysis/insights on this question with many refs/leads (incl related se questions) in this essay adventures & commotions in automated thm proving
Feb
8
comment is the Sudoku puzzle NP-complete?
looking for refs on the NP completeness of sudoko hope someone can link this question.
Jan
27
answered Is computer science a branch of mathematics?
Jan
10
answered Why are mathematical proofs that rely on computers controversial?
Jan
4
comment Minimum distance of a binary linear code
this seems to be a web page to compute it, see bounds on minimum distance of linear codes by Grassl
Jan
4
comment Minimum distance of a binary linear code
the paper seems to be by Vardy based on url but is not accessible [maybe not a eprint available]. another published citation would be ideal. maybe this ref? (found in another paper) Alexander Vardy. The intractability of computing the minimum distance of a code. IEEE Trans. Inform. Theory, 43(6):1757–1766, 1997.