2 citations · 2 across the 4 of their papers we have counts for
4 papers
A Little Reflection about the Sleeping Beauty Problem
André Luiz Barbosa
This paper presents a little reflection about the Sleeping Beauty Problem, maybe contributing to shed light on it and perhaps helping to find a simple and elegant solution that cou…
A Human-Checkable Four-Color Theorem Proof
André Luiz Barbosa
This paper presents a short and simple proof of the Four-Color Theorem that can be utterly checkable by human mathematicians, without computer assistance. The new key idea that has…
The Dead Cryptographers Society Problem
André Luiz Barbosa
This paper defines The Dead Cryptographers Society Problem - DCS (where several great cryptographers created many polynomial-time Deterministic Turing Machines (DTMs) of a specific…
P != NP Proof
André Luiz Barbosa
This paper demonstrates that P \not= NP. The way was to generalize the traditional definitions of the classes P and NP, to construct an artificial problem (a generalization to SAT:…