Voris is a computer scientist, a data scientist and an artificial intelligence pioneer. He worked as a mainframe systems, management and executive consultant for 30 years. He has an extensive background and understanding of all facets of the software development life cycle. He assisted numerous Fortune 500 companies with their information technology needs. These tasks range from planning and brainstorming to software development, data modeling, implementing computer architectures and multi-tier integrations. He has developed technological enterprise models, websites, expert systems, voice interfaces, inference engines, CASE tools, PC, server and mainframe software systems. He is interested in an executive, technical or research position that supports his cybernetic paradigm of threes theory and its application to 4IR. He currently resides in the USA, but is seeking relocation abroad. Click the images below to review his work for numerous American Fortune 500 companies. Click the JOBS image for a listing of all his positions in the computer industry.
Voris developed a solution to P NP. It is considered the world’s greatest math challenge and also the greatest problem in theoretical computer science. He solved P NP in 2010, but could not prove the algorithms. In the winter of 2013 he perfected the software to demonstrate proof of concept. Previously he contacted Clay Mathematics Institute for instruction. They recommended that a white paper be developed. Click the P NP icon to review the white paper.
1977-2007
Disclaimer: All images, ideas and linked web pages are for demonstration purposes only. The advertisements, products and paradigm of threes in marketing have no actual connection to Voris. Moreover, he has no position at IBM. Any perceived 'shadowing effects' within the contents of this site are in the eyes of the reviewer. Voris is a futuristic theorist. Some see evidence to support his theory and its connection to AI; others do not.
Creating Brilliance
Right here. Right now. Wright State.
"Understanding the P NP algorithms may have a significant impact on cybersecurity. Take for example, the passwords that we use for access to computer systems, email and our bank accounts. In reality, it is possible to develop a universal algorithm to arrive at these passwords. That is why we get locked out after only a few attempts. Adding length and strength to passwords makes the number of possibilities increase exponentially. Nevertheless, as computers become faster soon it will not matter how long or how strong a password is, it will not result in one impervious to a universal algorithm. Conversely, these P NP algorithms could be used to make it impossible to apply a universal algorithm, leading to a completely secure internet".
William T. Voris works as an IBM external technologist, visionary and consultant.
No more of this stupidity, how many tractors, how many traffic lights, choose the bat. Nobody hates this crap more than me. What a waste of time. These P NP algorithms can eliminate this.
