If you need to contact MarkCC, his email address is markcc@gmail.com. You can also find him on twitter as MarkCC.

16 thoughts on “Contact Info”

Harry

Hi Mark,

I’m a guy from China, I love your site, and have learnt a lot from it, that’s a great blog, I spread your blog with my colleagues, and they all love it and keep it in the bookmark and visit it at times.

Would you please the “Select Category” function? Seems that it doesn’t work on your new homepage, whatever I select from the popup list, either “Haskell” or “Category Theory”, they all show me nothing, that’s the reason for me, maybe for lots or other guys, still visit your old blog from scienceblogs 🙂

Looking forward to reading more great math/computer science articles from you.

We would support you always, just as we have done in the last few years!

Watching Jeopardy last night, I saw that one of the IBM scientists involved with the Watson project, or perhaps a spokesperson for IBM in general, was your wife!

Niw, I don’t know you or her, so this is a bit of an assumpton, and perhaps presumption, but I do remember you discussing on your blog, how you came to select your names. I became so excited seeing your (and my) surname on the TV, that I didn’t actually hear what she had to say. I was too busy explaining to my wife my (minimal) connection to you.

It’s been a while since I read this blog, but I recall commenting once, a few years ago, using the moniker, “Bob from Yorktown Hts” or some such. Another minimal connection – I don’t work for IBM, but have visited the Watson Research Center as a neighbor (and sometime research chemist). My neighbor and friend Vishnu Patel acted as guide.

It was fun seeing the structure of Watson on Jeopardy. I was a bit surprised to hear that the memory of that massive computer was only about 15 terabytes, if I heard correctly. Of course this is a lot of memory, but within reach for a PC user… It’s amazing how cheap memory storage has become since the advent of the original IBM Winchester drive.

I’m rooting for Ken Jennings. It was interesting to note that the contest (the first day, anyway,) was not a runaway success by Watson.

After the show, I described the Turing test to my wife, opining that Watson could pass this test, or at least give a good account of itself!

I’ll be reading your site more regularly again. Math is a better recreation than just about any other intellectual activity.

Code reviews are probably implicitly discouraged in undergraduate classes, in part because grades are meant to represent individual achievement. And I haven’t heard much about code reviews in software engineering classes where people are grouped together. Perhaps the closest thing students get to a code review is that from their professor.

I saw your site while trying to do some numerology debunking. Any thoughts about karmic debt numbers? It looks like scare tactics to me but I wanted a real mathematical opinion on this.

Arc represents the relationship between the circumference of the circle and the
perimeter on the subscribed squares the circle.
Expressed as a formula:
Arc = C : P

Arc – circular arc
C – circumference of the circle
P – perimeter on the subscribed squares the circle

Arc is also a relationship between the value of the approximation and the second
root from eight.
Expressed as a formula:

Arc = Ap : √8

Ap – approximation

From this it follows that the value of the circular arch as constants, in addition to the value of the approximation can be used to calculate the value of the c

METHOD OF CALCULATION THE CIRCUMFERENCE

OF THE CIRCLE WITH THE CIRCULAR ARC

a * arc = a1

P = 4 * a1 = 2r * Ap = C

a – side on the subscribed squares the circle
a1 – side on the squares with same perimeter as circle
P – perimeter on the squares
C – circumference of the circle
D * arc = D1
P = D1 * √8 = 2r * Ap = C

D – diagonal on the subscribed squares the circle
D1 – diagonal on the squares with same perimeter as circle
METHOD OF CALCULATING THE AREA OF A CIRCLE
WITH A CIRCULAR ARC

a * arc = a1 D * arc = D1

Area rectangle = a * D1 = (r * r) * Ap = Area circle
Area rectangle = a1 * D = (r * r) * Ap = Area circle

a – side on the subscribed squares on the circle
a1 – side on the squares with same perimeter as circle
D – diagonal on the subscribed squares on the circle
D1 – diagonal on the squares with same perimeter as circle

This method of calculating the circumference and area of the circle can beapplied in all approximations, but geometrically, we can only draw an approximation of the results, the following value (3,142696805…)

Ap = √8 * 10/9 = 3,142696805.. or Ap = √8 + (√8/9) = 3,142696805

This guy says he solved the P/NP problem. He’s supposedly a network engineer, but the math on it stinks. I heard about him on the Technische Universiteit page that keeps count on the so-called solutions. The arrogance of this guy made me clinch. Someone cares to debunk him? http://arxiv.org/ftp/arxiv/papers/1503/1503.04794.pdf
Michael Laplante

P=NP can be proven by the disproofs of the P≠NP “proofs” relying on dm (diagonal methods), using dm d’s (diagonal methods disproofs/disqualifications). I have other proofs, though.
Please see: https://forum.wordreference.com/conversations/february-2022.1616506/
So, this Mr./Dr./Prof. Laplante must be or at least can be right.

It’s at least a mister, not Ms., if the LaPlante is a French or German or English-speaking person. If French, the pronunciation is meekah-ell; if German, meehyah-ell.

I was reading about Bloom filters the other day. It would be interesting to read your take about them.

I was wondering if Bloom filter could work as an encryption as is?

In a different approach, I started thinking whether it would work as a source for pseudorandom numbers. More specifically, I was curious if one could make a one time pad that would only need to be exchanged once at the beginning and then both sides can keep adding known data to the filter to ‘mix’ the bag.

Uh. I know. This is starting to sound confused enough and really dangerous security-wise. Exactly the moment when it would really help to get some other, perhaps clearer, brains into it.

HarryHi Mark,

I’m a guy from China, I love your site, and have learnt a lot from it, that’s a great blog, I spread your blog with my colleagues, and they all love it and keep it in the bookmark and visit it at times.

Would you please the “Select Category” function? Seems that it doesn’t work on your new homepage, whatever I select from the popup list, either “Haskell” or “Category Theory”, they all show me nothing, that’s the reason for me, maybe for lots or other guys, still visit your old blog from scienceblogs 🙂

Looking forward to reading more great math/computer science articles from you.

We would support you always, just as we have done in the last few years!

Best Regards,

Harry

rpsmsBees and NP-Hard problem:

http://www.qmul.ac.uk/media/news/items/se/38864.html

My gut says that the PR is overstating the paper. Possible article?

Bob CarrollHi, Mark,

Watching Jeopardy last night, I saw that one of the IBM scientists involved with the Watson project, or perhaps a spokesperson for IBM in general, was your wife!

Niw, I don’t know you or her, so this is a bit of an assumpton, and perhaps presumption, but I do remember you discussing on your blog, how you came to select your names. I became so excited seeing your (and my) surname on the TV, that I didn’t actually hear what she had to say. I was too busy explaining to my wife my (minimal) connection to you.

It’s been a while since I read this blog, but I recall commenting once, a few years ago, using the moniker, “Bob from Yorktown Hts” or some such. Another minimal connection – I don’t work for IBM, but have visited the Watson Research Center as a neighbor (and sometime research chemist). My neighbor and friend Vishnu Patel acted as guide.

It was fun seeing the structure of Watson on Jeopardy. I was a bit surprised to hear that the memory of that massive computer was only about 15 terabytes, if I heard correctly. Of course this is a lot of memory, but within reach for a PC user… It’s amazing how cheap memory storage has become since the advent of the original IBM Winchester drive.

I’m rooting for Ken Jennings. It was interesting to note that the contest (the first day, anyway,) was not a runaway success by Watson.

After the show, I described the Turing test to my wife, opining that Watson could pass this test, or at least give a good account of itself!

I’ll be reading your site more regularly again. Math is a better recreation than just about any other intellectual activity.

Bob Carroll

Robert KonigsbergCode reviews are probably implicitly discouraged in undergraduate classes, in part because grades are meant to represent individual achievement. And I haven’t heard much about code reviews in software engineering classes where people are grouped together. Perhaps the closest thing students get to a code review is that from their professor.

Alex CHey Mark,

I saw your site while trying to do some numerology debunking. Any thoughts about karmic debt numbers? It looks like scare tactics to me but I wanted a real mathematical opinion on this.

Thanks,

– Alex

Antonio JonjićSQUARE – CIRCULAR ARC – CIRCLE

Arc represents the relationship between the circumference of the circle and the

perimeter on the subscribed squares the circle.

Expressed as a formula:

Arc = C : P

Arc – circular arc

C – circumference of the circle

P – perimeter on the subscribed squares the circle

Arc is also a relationship between the value of the approximation and the second

root from eight.

Expressed as a formula:

Arc = Ap : √8

Ap – approximation

From this it follows that the value of the circular arch as constants, in addition to the value of the approximation can be used to calculate the value of the c

METHOD OF CALCULATION THE CIRCUMFERENCE

OF THE CIRCLE WITH THE CIRCULAR ARC

a * arc = a1

P = 4 * a1 = 2r * Ap = C

a – side on the subscribed squares the circle

a1 – side on the squares with same perimeter as circle

P – perimeter on the squares

C – circumference of the circle

D * arc = D1

P = D1 * √8 = 2r * Ap = C

D – diagonal on the subscribed squares the circle

D1 – diagonal on the squares with same perimeter as circle

METHOD OF CALCULATING THE AREA OF A CIRCLE

WITH A CIRCULAR ARC

a * arc = a1 D * arc = D1

Area rectangle = a * D1 = (r * r) * Ap = Area circle

Area rectangle = a1 * D = (r * r) * Ap = Area circle

a – side on the subscribed squares on the circle

a1 – side on the squares with same perimeter as circle

D – diagonal on the subscribed squares on the circle

D1 – diagonal on the squares with same perimeter as circle

This method of calculating the circumference and area of the circle can beapplied in all approximations, but geometrically, we can only draw an approximation of the results, the following value (3,142696805…)

Ap = √8 * 10/9 = 3,142696805.. or Ap = √8 + (√8/9) = 3,142696805

lilyhi, i thought you might be interested in this crock

http://vortexmath.webs.com/

frankim sorry lily you didn’t invent the Rodin coil . Marko Rodin did . and it works .unlike the useless whining from your comment.

Kurt Becker (@igetrashes)Hi Mark, here’s another one for the doubtless growing pile of cracked pottery.

http://existics101.com/

L.D.Greetings,

I’m not calling this a crock… however, something just doesn’t seem correct about this and I can’t put my finger on in.

http://phys.org/news/2013-08-cosmologist-universe.html

Sean HolmanThere’s some pretty good bad math and physics here:

http://www.wildheretic.com/

Daniel LimaThis guy says he solved the P/NP problem. He’s supposedly a network engineer, but the math on it stinks. I heard about him on the Technische Universiteit page that keeps count on the so-called solutions. The arrogance of this guy made me clinch. Someone cares to debunk him?

http://arxiv.org/ftp/arxiv/papers/1503/1503.04794.pdf

Michael Laplante

Koiti KimuraP=NP can be proven by the disproofs of the P≠NP “proofs” relying on dm (diagonal methods), using dm d’s (diagonal methods disproofs/disqualifications). I have other proofs, though.

Please see:

https://forum.wordreference.com/conversations/february-2022.1616506/

So, this Mr./Dr./Prof. Laplante must be or at least can be right.

Koiti KimuraExcuse me; I had missed your evaluation of that “theory”:

http://www.goodmath.org/blog/2015/04/27/a-failed-attempt-to-prove-p-np/

But still, it can be easily shown that P=NP as in the above.

It’s at least a mister, not Ms., if the LaPlante is a French or German or English-speaking person. If French, the pronunciation is meekah-ell; if German, meehyah-ell.

Jarmo J.I was reading about Bloom filters the other day. It would be interesting to read your take about them.

I was wondering if Bloom filter could work as an encryption as is?

In a different approach, I started thinking whether it would work as a source for pseudorandom numbers. More specifically, I was curious if one could make a one time pad that would only need to be exchanged once at the beginning and then both sides can keep adding known data to the filter to ‘mix’ the bag.

Uh. I know. This is starting to sound confused enough and really dangerous security-wise. Exactly the moment when it would really help to get some other, perhaps clearer, brains into it.

Jimmy SaundersMark, please have a look at this guy’s stuff on Cantor and infinity, such as

https://observablehq.com/@dlaliberte/infinite-binary-tree-of-intervals

and

https://observablehq.com/@dlaliberte/refutation-of-cantors-diagonalization

It is mind boggling how many misconceptions he manages to squeeze in, it would make a great and very amusing article.