1. 
Angela MASTANTUNO
2. Angela Mastantuno
3. Debbie Mastantuno ♀
4. DOROTHY MASTANTUNO
5. Gloria Mastantuno (Gloria R Mastantuno) ♀
6. Gloria Mastantuno ♀
7. GLORIA MASTANTUNO
8. GLORIA MASTANTUNO
9. Jackie Mastantuno ♂
10. Jessica Mastantuno
11. Jessica MASTANTUNO
13. Joseph Mastantuno ♂
14. JOSEPH MASTANTUNO
15. Karl Mastantuno
16. Karl MASTANTUNO
20. KARL MASTANTUNO
21. KARL MASTANTUNO
23. Kimberly Mastantuno ♀
24. Kimberly Mastantuno ♀
25. KIMBERLY MASTANTUNO
26. 
L. MASTANTUNO
27. LILLIAN MASTANTUNO
28. Lorraine Mastantuno (Lorraine A Mastantuno) ♀
29. Lynne Mastantuno
30. Lynne MASTANTUNO
31. Lynne MASTANTUNO
32. Lynne Mastantuno
33. Lynne Mastantuno (Lynne R Mastantuno) ♀
34. Lynne Mastantuno
35. Lynne MASTANTUNO
36. LYNNE MASTANTUNO
37. LYNNE MASTANTUNO
38. LYNNE MASTANTUNO
39. LYNNE MASTANTUNO
42. ROBERT MASTANTUNO ♂
43. ROBERT MASTANTUNO
44. SARAH LAUREN MASTANTUNO
45. SEIBEN MASTANTUNO
46. Thomas Mastantuno ♂
47. Vincent Mastantuno (Vincent W Mastantuno Jr) ♂
48. Vincent Mastantuno (Vincent W Mastantuno) ♂
49. Vincent Mastantuno
50. Vincent MASTANTUNO
51. VINCENT MASTANTUNO
A software developer with interest in mathemathics, formal systems and undecidability. I like the halting problem and the Gödel incompletness theorems. Specifically, I like the fact that there is a non-constructive proof of the existence of an infinite set of programs that don`t halt and also have no non-termination proof, that can`t be known by example. I like to conjecture that a program that enumerates ZFC theorems and has the instruction to halt if it finds a P=NP theorem or its negation is one of these programs. 
©
©52. VINCENT ANTHONY MASTANTUNO ♂