Hackaday.io Hackaday.io
Projects
Discover Contests Courses Stack
More
Courses Tutorials Events Hackerspaces Hackaday.com Tindie Marketplace
Sign up Log in
Close
0%
0%

Reality-based computations (Non-Turing)

Researching a novel method to solve tasks, including NP

capitanveshdokiCapitanVeshdoki
Following Follow project
Liked Like project

Become a Hackaday.io member

Not a member? You should Sign up.

Already have an account? Log in.

Sign up with Github
Sign up with Twitter
OR
Forgot your password?

Just one more thing

To make the experience fit your profile, pick a username and tell us what interests you.

Pick an awesome username
hackaday.io/
Your profile's URL: hackaday.io/username. Max 25 alphanumeric characters.
Pick a few interests
Projects that share your interests
People that share your interests

We found and based on your interests.

Choose more interests.

OK, I'm done! Skip
Join this project
Similar projects worth following
74 views
3 comments
0 followers
0 likes
  • Description
  • Details
  • Files 1
    • View all
  • Components 0
  • Logs 0
  • Instructions 0
  • Discussion 3
View Gallery
74
3
0
0

Team (1)

  • capitanveshdokiCapitanVeshdoki

Join this project's team
MISC
researching project
Np tasks computations non-Turing

This project was created on 04/15/2019 and last updated 6 years ago.

Description

Originally it is for research paper, so I gonna publish everything "as is". Maybe I would convert it into web-page later, who knows :)

Details

Files

reality-based.pdf

Article about this project (theory, how to, thoughts e.t.c.)

Adobe Portable Document Format - 41.88 MB - 04/15/2019 at 15:17

Preview

Enjoy this project?

Share

Discussions

Log In/Sign up to comment

Become a Hackaday.io Member

Create an account to leave a comment. Already have an account? Log In.

Sign up with Github
Sign up with X
OR
agp.cooper wrote 08/12/2020 at 23:46 • point

Okay, you get the idea.

I suspect if your logic contained states (i.e flip flops) then it could be Turing but I am not an expert here. It a bit like the days of analog computers. There was a need when digital computers where a dream.

Anyway, I thought that it added a tool to my tool box. I have a number of "demo" like projects (a Turing machine being one of them). So the idea of converting a simple problem and an algorithm into a hardware demonstration is something worth keeping.

AlanX

  Are you sure? yes | no

agp.cooper wrote 08/12/2020 at 02:37 • point

Okay, perhaps I am wrong, but you appear to be describing a hardware greedy and/or iterative algorithm to solve your Sudoku problem. As such, your machine is still subject to the normal rules of algorithms (P!=NP etc) and your logic may not scale very well or even find a solution. Such is P!=NP. Unfortunately, Sudoku (the 9x9 case) is a know hard problem to solve.

Some thoughts:
* You can model many simple iterative algorithms with your approach, one example from my past was to model an underground ventilation system (a flow network) using "Kirchhoff's current law" as the iterative algorithm.
* Rather than a discrete hardware logic and finite state machine, you could a simple one-bit computer (as these work well in this domain).

* So there are many real world problem you can solve, that would make fun demonstration units. That is demonstrations units that don't use a microprocessor for control. The demonstration unit could feature the iterative algorithm and the real world problem it solves.

Any, best of luck with your project, regards AlanX

  Are you sure? yes | no

CapitanVeshdoki wrote 08/12/2020 at 13:29 • point

Sure, that's why this project was abandoned - it was a nice theory, however without practical applications it makes not much sense, especially being that hardware greedy (*possibly it can be done using FPGA as alternative*)

Someone told me, that it looks a lot like reservoir computation device, from my perspective it's more accurate, of course it's iterative, but algorithm as a sequence of instructions make sense only within the boundaries of blocks (e.g. numbers in case of sudoku), as you define rules using logic elements. It's hard to predict how it works in general and how blocks affect each other, no synchronization present, as well as no algorithm describes how to solve a task. It's funny that it works with all those ridiculous conditions.

As a non-Turing way to complete tasks it makes sense, is it fast or not - open for discussion. With my <suspicious> measurements it was impressive, but task wasn't horribly hard either.

Maybe at some point I will continue doing something with that concept, which was very curious. Can make a guess: there would be something to do with cryptography , )

  Are you sure? yes | no

Similar Projects

Web Designing Assignment HTML5, CSS3 & JS
Project Owner Contributor

CSS Practice

parnika-guptaParnika Gupta

We used Virtual Reality to “walk in the shoes” of a person with visual impairment.
Project Owner Contributor

Perspective: a VR experience about empathy

rodolfoRodolfo

Cat Exploit is focussed on creating an independent WiFi network based on urban animals wearing minified wardriving servers.
Project Owner Contributor

Cat Exploit

dennis-siegelDennis Siegel

Web pages representing the notes I use to lecture in ECE5760 at Cornell University.
Project Owner Contributor

Cyclone5, DE1-SoC, FPGA lecture topics

bruce-landBruce Land

Does this project spark your interest?

Become a member to follow this project and never miss any updates

Going up?

About Us Contact Hackaday.io Give Feedback Terms of Use Privacy Policy Hackaday API

© 2025 Hackaday

Yes, delete it Cancel

Report project as inappropriate

You are about to report the project "Reality-based computations (Non-Turing)", please tell us the reason.

Send message

Your application has been submitted.

Remove Member

Are you sure you want to remove yourself as a member for this project?

Project owner will be notified upon removal.