In the United States, a Social Security number (SSN) is a nine-digit number issued to U.S. citizens, permanent residents, and temporary (working) residents under section 205(c)(2) of the Social Security Act, codified as 42 U.S.C. § 405(c)(2). The number is issued to an individual by the Social Security Administration, an independent agency of the United States government. Although the original purpose for the number was for the Social Security Administration to track individuals,[1] the Social Security number has become a de facto national identification number for taxation and other purposes.[2]
https://en.m.wikipedia.org/wiki/Social_Security_number
https://en.m.wikipedia.org/wiki/Social_Security_number
🤬12👍3❤2🔥1
Both SSN and the CUSIP numeric or alphanumeric code of 9 digits use to ID the stocks and companies…
Your birth certificate is traded like stock and own by other corporations.. because of the federal reserve and international monetary fund selling you like bonds… your worth is sold back in the public where number of corporations buy it up…
Your birth certificate is traded like stock and own by other corporations.. because of the federal reserve and international monetary fund selling you like bonds… your worth is sold back in the public where number of corporations buy it up…
😈13🤬5👍3🔥2
https://en.m.wikipedia.org/wiki/National_numbering_agency
A national numbering agency (NNA) is the organisation in each country responsible for issuing International Securities Identification Numbers (ISIN) as described by the ISO 6166 standard and the Classification of Financial Instruments code as described by the ISO 10962 standard. The role of NNA is typically assigned to the national stock exchange, central bank, or financial regulator but may be as diverse as a financial data provider or clearing and custodian organisation for that country.
There is a global governing body that coordinates the work of the NNAs called the Association of National Numbering Agencies (ANNA).[1]
A national numbering agency (NNA) is the organisation in each country responsible for issuing International Securities Identification Numbers (ISIN) as described by the ISO 6166 standard and the Classification of Financial Instruments code as described by the ISO 10962 standard. The role of NNA is typically assigned to the national stock exchange, central bank, or financial regulator but may be as diverse as a financial data provider or clearing and custodian organisation for that country.
There is a global governing body that coordinates the work of the NNAs called the Association of National Numbering Agencies (ANNA).[1]
Wikipedia
National numbering agency
international organization
👍8❤2😢1
“(A Prayer of David.) Bow down thine ear, O LORD, hear me: for I am poor and needy.”“Preserve my soul; for I am holy: O thou my God, save thy servant that trusteth in thee.”“Be merciful unto me, O Lord: for I cry unto thee daily.”“Rejoice the soul of thy servant: for unto thee, O Lord, do I lift up my soul.”“For thou, Lord, art good, and ready to forgive; and plenteous in mercy unto all them that call upon thee.” “Give ear, O LORD, unto my prayer; and attend to the voice of my supplications.”“In the day of my trouble I will call upon thee: for thou wilt answer me.”“Among the gods there is none like unto thee, O Lord; neither are there any works like unto thy works.”“All nations whom thou hast made shall come and worship before thee, O Lord; and shall glorify thy name.”“For thou art great, and doest wondrous things: thou art God alone.”“Teach me thy way, O LORD; I will walk in thy truth: unite my heart to fear thy name.”“I will praise thee, O Lord my God, with all my heart: and I will glorify thy name for evermore.”“For great is thy mercy toward me: and thou hast delivered my soul from the lowest hell.”“O God, the proud are risen against me, and the assemblies of violent men have sought after my soul; and have not set thee before them.”“But thou, O Lord, art a God full of compassion, and gracious, longsuffering, and plenteous in mercy and truth.”“O turn unto me, and have mercy upon me; give thy strength unto thy servant, and save the son of thine handmaid.”“Shew me a token for good; that they which hate me may see it, and be ashamed: because thou, LORD, hast holpen me, and comforted me.”
Psalms 86:1-17
Psalms 86:1-17
❤27
https://en.m.wikipedia.org/wiki/Quantum_supremacy
In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that no classical computer can solve in any feasible amount of time, irrespective of the usefulness of the problem.[1][2][3] The term was coined by John Preskill in 2012,[1][4] but the concept dates back to Yuri Manin's 1980[5] and Richard Feynman's 1981[6] proposals of quantum computing.
Conceptually, quantum supremacy involves both the engineering task of building a powerful quantum computer and the computational-complexity-theoretic task of finding a problem that can be solved by that quantum computer and has a superpolynomial speedup over the best known or possible classical algorithm for that task.[7][8]
Examples of proposals to demonstrate quantum supremacy include the boson sampling proposal of Aaronson and Arkhipov,[9] D-Wave's specialized frustrated cluster loop problems,[10] and sampling the output of random quantum circuits.[11][12] The output distributions that are obtained by making measurements in boson sampling or quantum random circuit sampling are flat, but structured in a way so that one cannot classically efficiently sample from a distribution that is close to the distribution generated by the quantum experiment. For this conclusion to be valid, only very mild assumptions in the theory of computational complexity have to be invoked. In this sense, quantum random sampling schemes can have the potential to show quantum supremacy.
In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that no classical computer can solve in any feasible amount of time, irrespective of the usefulness of the problem.[1][2][3] The term was coined by John Preskill in 2012,[1][4] but the concept dates back to Yuri Manin's 1980[5] and Richard Feynman's 1981[6] proposals of quantum computing.
Conceptually, quantum supremacy involves both the engineering task of building a powerful quantum computer and the computational-complexity-theoretic task of finding a problem that can be solved by that quantum computer and has a superpolynomial speedup over the best known or possible classical algorithm for that task.[7][8]
Examples of proposals to demonstrate quantum supremacy include the boson sampling proposal of Aaronson and Arkhipov,[9] D-Wave's specialized frustrated cluster loop problems,[10] and sampling the output of random quantum circuits.[11][12] The output distributions that are obtained by making measurements in boson sampling or quantum random circuit sampling are flat, but structured in a way so that one cannot classically efficiently sample from a distribution that is close to the distribution generated by the quantum experiment. For this conclusion to be valid, only very mild assumptions in the theory of computational complexity have to be invoked. In this sense, quantum random sampling schemes can have the potential to show quantum supremacy.
Wikipedia
Quantum supremacy
potential ability of quantum computing devices to solve problems efficiently that classical computers practically cannot solve efficiently
❤4😁2