|
| Budget: |
$ 300-1000 |
| Status: |
Open
for Bidding (29 days left)
|
| Project
Creator: |
|
| |
Rating: (No Feedback Yet)
|
| Required
Skills: |
,
|
| Attached
Files: |
(None) |
Description
The purpose of this project is to create a debugger program. This program will take as input the source code another program, and will analyze that other program and determine if it will run to completion, or have an error, or go into an infinite loop.
To state that another way, given a function f and input x, determine if f(x) will halt.
Reminder
You may not start working in this and any project before
your bid is accepted. Any user who violates this policy
may have their account permanently suspended.
|
| Shortlist |
| Decline Bid |
|
|
Chennai,
IN
location |
US$1,800
bid amount |

         
(7
reviews)
feedback |

18 day(s)
delivery time |

|
| |
We have gone through your project specifications; give us the opportunity to arise up your needs to be done. We can do this task as sprint; let us do this work for you as per your timeline and schedule. We have a top-notch team. We ensure that your feedback and comments are timely reflected in the technical specification on all stages of the projects Development. We are ready to start the work. Thanks & Warm Regards, Team - KAG Tech.
Bid Time: 11-25-2008 05:00
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Manama,
BH
location |
US$2,000
bid amount |

         
(6
reviews)
feedback |

10 day(s)
delivery time |

|
| |
Clear with your requirements, ready to start.
Bid Time: 11-22-2008 14:18
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
New Delhi,
IN
location |
US$1,000
bid amount |

         
(1
reviews)
feedback |

15 day(s)
delivery time |

|
| |
Please open PMB.
Bid Time: 11-22-2008 05:04
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Delhi,
IN
location |
US$1,200
bid amount |

         
(1
reviews)
feedback |

25 day(s)
delivery time |

|
| |
Hi Sir,
Please check your PMB.
Thanks and Regards
pro
Bid Time: 11-24-2008 13:03
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
chennai,
IN
location |
US$300
bid amount |

(No Feedback
Yet)
feedback |

10 day(s)
delivery time |

|
| |
hi,
pls check PM
Bid Time: 11-21-2008 11:30
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
NOIDA,
IN
location |
US$550
bid amount |

(No Feedback
Yet)
feedback |

10 day(s)
delivery time |

|
| |
Dear Mr.AlanT,
We are ready to start up with your Project with our excellent team of programmers, Designers & Project Managers. We are 100% confident for a successful delivery of your Project. We are providing our Services to many Big Client Across Globe & are looking for an Excellent Long term Business Relationship with your Esteemed Organization. Please Check your PMB for our company Profile & Our Portfolio.
Warm regards
Bid Time: 11-21-2008 11:52
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Slough,
GB
location |
US$550
bid amount |

(No Feedback
Yet)
feedback |

10 day(s)
delivery time |

|
| |
Hello, we have an Expert team of 70 Webdesigners and developers, who will do very impressive designing for you .They will start working on your Project Bug Finder ASAP.There will be constant communication online and on phone. Please visit PMB for the work examples...Looking forward to hear from you and discuss further on the project, Thanks, Shivani
Bid Time: 11-22-2008 00:01
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Greater Noida,
IN
location |
US$900
bid amount |

(No Feedback
Yet)
feedback |

20 day(s)
delivery time |

|
| |
Please see PMB.
Thanks,
Shyam
Bid Time: 11-22-2008 01:52
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Mashhad,
IR
location |
US$500
bid amount |

(No Feedback
Yet)
feedback |

10 day(s)
delivery time |

|
| |
Hi.
Please Send me a PM.
Thanks.
Bid Time: 11-22-2008 02:16
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Sofia,
BG
location |
US$300
bid amount |

(No Feedback
Yet)
feedback |

15 day(s)
delivery time |

|
| |
Bid amaount is 300$ for 15 days delivery time
Bid Time: 11-22-2008 13:20
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Hindmotor,
IN
location |
US$750
bid amount |

(No Feedback
Yet)
feedback |

30 day(s)
delivery time |

|
| |
Please see PM
Bid Time: 11-23-2008 01:21
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Islamabad,
PK
location |
US$500
bid amount |

(No Feedback
Yet)
feedback |

15 day(s)
delivery time |

|
| |
Dear Sir/Madam,
I looked at your bid request and I am here to tell you that we are really interested in this
project and we are exacatly the coders you are looking for. I assure you that
we can really do it the way you want.In 15 days we can bring you high
quality results to your complete satisfaction, along with 90 days of warranty upon the
delivery of the final version of our product.
We're looking forward to starting this project as soon as possible. Just give us a chance ,
you will never be disappointed. Its not about doing it , its about doing it professionally
exactly according to the requirements.
For further details please check your PMB.
Best regards,
Sohail,
Arkotech Corporation.
Bid Time: 11-24-2008 03:39
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Lisboa,
PT
location |
US$300
bid amount |

(No Feedback
Yet)
feedback |

0 day(s)
delivery time |

|
| |
Dear Mr T. Your problem is very much like I have been considering. Assume that we have a consistent and complete axiomatization of all true first-order logic statements about natural numbers. Then we can build an algorithm that enumerates all these statements. This means that there is an algorithm N(n) that, given a natural number n, computes a true first-order logic statement about natural numbers such that, for all the true statements, there is at least one n such that N(n) yields that statement. Now suppose we want to decide if the algorithm with representation a halts on input i. We know that this statement can be expressed with a first-order logic statement, say H(a, i). Since the axiomatization is complete it follows that either there is an n such that N(n) = H(a, i) or there is an n' such that N(n') = ¬ H(a, i). So if we iterate over all n until we either find H(a, i) or its negation, we will always halt. This means that this gives us an algorithm to decide the halting problem. Since we know that there cannot be such an algorithm, it follows that the assumption that there is a consistent and complete axiomatization of all true first-order logic statements about natural numbers must be false. There is no way your application can be built, and for this advice I am willing to waive any fee. Sincerely, K. Gödel.
Bid Time: 11-25-2008 06:02
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Frankfurt,
DE
location |
US$300
bid amount |

(No Feedback
Yet)
feedback |

1 day(s)
delivery time |

|
| |
As the superior German programmer I am I've already solved the problem in my head as per your specification.
I'm able to deliver a solution in source code in any language that can print a line of text. If necessary, I can also provide flowcharts and a solution on solid German-made paper.
Bid Time: 11-25-2008 06:05
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
,
location |
US$1,000
bid amount |

(No Feedback
Yet)
feedback |

1 day(s)
delivery time |

|
| |
Dear Sir,
You have found the right person to do the job. I am a representative of a company that has recently completed a large enterprise commercial project related to the development of a HaltLib.NET library that is meant specifically to solve the problem of interest to you, and I am ready to share my experiences and code.
Note that our library works for a wide variety of programming languages, including, but not limited to, HTML, XML, PNG, CSV, SQL, BNF, Regular Expressions and even "Field=Value" .property file formats.
I guarantee you maximally efficient and clean code on this project.
Bid Time: 11-25-2008 07:31
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Halle,
DE
location |
US$800
bid amount |

(No Feedback
Yet)
feedback |

1 day(s)
delivery time |

|
| |
Herr T,
Despite the fact that I died in 1918 you may find the following advice important. I would be happy to work on your project but you will quickly find that it is impossible, nay undecidable. It is a simple consequence of my diagonalization argument for uncountable numbers that were such a program to exist it would be possible to create a program on which it could not work and hence you would obtain a contradiction and your original program would 'disappear in a puff of logic'.
Gruß Gott,
Georg
Bid Time: 11-25-2008 08:08
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Lodz,
GB
location |
US$1,729
bid amount |

(No Feedback
Yet)
feedback |

1 day(s)
delivery time |

|
| |
I will solve your problem in the most productive manner possible.
Bid Time: 11-25-2008 08:28
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Atlanta,
US
location |
US$300
| | |