Search Results

Search found 113 results on 5 pages for 'turing'.

Page 3/5 | < Previous Page | 1 2 3 4 5  | Next Page >

• chomsky hierarchy and programming languages

  - by dader51

  Hi, I'm trying to learn some aspects of the CH ( chomsky hierarchy ) which are related to PL ( programming languages ), and i still have to read the Dragon Book. I've read that most of the PL can be parsed as CFG ( context free grammar ). In term of computational power, it equals the one of a pushdown non deterministic automaton. Am I right ? If…

  Read the article

• CodePlex Daily Summary for Sunday, July 01, 2012

  CodePlex Daily Summary for Sunday, July 01, 2012Popular ReleasesEnterprise Library 5 Caching with ProtoBuf.NET: Initial Release: This is the initial version, which includes zipped up sourcecode????: ????2.0.3: 1、???????????。 2、????????。 3、????????????。 4、bug??，????。Apworks: Apworks (v2.5.4563.21309, 30JUN2012): Installation Prerequisites: 1.…

  Read the article

• Stack vs queue -based programming language efficiency [closed]

  - by Core Xii

  Suppose there are two programming languages; one where the only form of storage is one (preferred) or two (may be required for Turing-completeness) stacks, and another where the only form of storage is a single queue, with appropriate instructions in each to manipulate their respective storage to achieve Turing-completeness. Which one can…

  Read the article

• Why aren't there automated translators from one programming language to another?

  - by serg

  Most programming languages are Turing complete, which means that any task that can be solved in one language can be solved in another one, or even on Turing machine. Then why aren't there automatic translators that can convert programs from any given language to any other language? I've seen couple attempts for two languages, but they…

  Read the article

• Is there a phrase or word to describe an algorithim or programme is complete in that given any value for its arguments there is a predictable outcome?

  - by Mrk Mnl

  Is there a phrase to describe an algorithim or programme is complete in that given any possible value for its arguments there is a predicatable outcome? i.e. all the ramifications have been considered whatever the context? A simple example would be the below function: function returns string get_item_type(int type_no) { if(type_no…

  Read the article

• Quel est votre "obscure" langage de programmation préféré ? Unlambda, Fractran, Befung, le plus comp

  Quel est votre "obscure" langage de programmation préféré ? Unlambda, Fractran, Befung, le plus compliqué du monde, un autre ? Unlambda, vous connaissez ? Non ?!? C'est "un langage minimal de programmation fonctionnelle inventé par David Madore qui est fondé sur le principe de la logique combinatoire, une version du lambda-calcul…

  Read the article

• Is there a phrase or word to describe an algorithim or program is complete in that given any value for its arguments there is a defined outcome?

  - by Mrk Mnl

  Is there a phrase or word to describe an algorithim or programme is complete in that given any value for its arguments there is a defined outcome? i.e. all the ramifications have been considered whatever the context? A simple example would be the below function: function returns string get_item_type(int type_no) { if(type_no <…

  Read the article

• Can you help me think of problems for my programming language?

  - by I can't tell you my name.

  I've created an experimental toy programming language with a (now) working interpreter. It is turing-complete and has a pretty low-level instruction set. Even if everything takes four to six times more code and time than in PHP, Python or Ruby I still love programming all kinds of things in it. So I got the "basic" things that are…

  Read the article

• Things you should implement in your own programming language

  - by I can't tell you my name.

  I've created an experimental toy programming language with a (now) working interpreter. It is turing-complete and has a pretty low-level instruction set. Even if everything takes four to six times more code and time than in PHP, Python or Ruby I still love programming all kinds of things in it. So I got the "basic" things that are…

  Read the article

• L'inventeur du pi-calcul est mort, Robin Milner nous quitte à 76 ans

  L'inventeur du pi-calcul est mort, Robin Milner nous quitte à 76 ans Robin Milner est décédé hier à Cambridge, où il fut professeur à l'Université (ainsi qu'à celles de Londres, Swansea, Edimbourg et Stanford). Informaticien anglais, il a fait trois découvertes principales dans sa carrière, qui ont largement contribué à l'évolution…

  Read the article

• Google met à jour reCAPTCHA et teste si vous êtes un humain avant, pendant et après que vous ayez interagi avec le CAPTCHA

  Google met à jour reCAPTCHA et teste si vous êtes un humain avant, pendant et après que vous ayez interagi avec le CAPTCHA Le CAPTCHA (Completely Automated Public Turing test to tell Computers and Humans Apart) est un moyen de sécurité sur le net permettant de différencier un humain des robots ou des spammeurs par la génération à…

  Read the article

• CodePlex Daily Summary for Wednesday, May 05, 2010

  CodePlex Daily Summary for Wednesday, May 05, 2010New Projects2010微软精英大挑战Heritage of Dragon项目: 我们来自上海市同济大学，兴趣相投，集聚于此共同构建一个开放的网络平台。致力于运用构建在云端基于地图的服务，使用文字、图片、视频、互动动画等形式来展示全国各地的传统手工艺。并且充分发挥网络的优势，通过开放协作的维基平台人人都可以参与到内容的添加修改与完善中来。目的在于记录、展示、挖掘、传承中国古...AutoArchive: Auto archive your "my documents" to a remote machine. I'm writing this so…

  Read the article

• Which are the fundamental stack manipulation operations?

  - by Aadit M Shah

  I'm creating a stack oriented virtual machine, and so I started learning Forth for a general understanding about how it would work. Then I shortlisted the essential stack manipulation operations I would need to implement in my virtual machine: drop ( a -- ) dup ( a -- a a ) swap ( a b -- b a ) rot ( a b c -- b c a ) I believe…

  Read the article

• Theoretically bug-free programs

  - by user2443423

  I have read lot of articles which state that code can't be bug-free, and they are talking about these theorems: Halting problem Gödel's incompleteness theorem Rice's theorem Actually Rice's theorem looks like an implication of the halting problem and the halting problem is in close relationship with Gödel's incompleteness…

  Read the article

• Can someone provide a short code example of compiler bootstrapping?

  - by Jatin

  This Turing award lecture by Ken Thompson on topic "Reflections on Trusting Trust" gives good insight about how C compiler was made in C itself. Though I understand the crux, it still hasn't sunk in. So ultimately, once the compiler is written to do lexical analysis, parse trees, syntax analysis, byte code generation etc, a…

  Read the article

• Objective-measures of the power of programming languages

  - by Casebash

  Are there any objective measures for measuring the power of programming languages? Turing-completeness is one, but it is not particularly discriminating. I also remember there being a few others measures of power which are more limited versions (like finite-state-autonoma), but is there any objective measure that is more…

  Read the article

• Additional macro support in clang?

  - by anon

  Since LLVM/cLang is especially well designed. This seems like a great opportunity to augment the C/C++ macro/preprocessor system. Does anyone know of additional macro/preprocessor abilities added by Clang or side projects to make the macro system more powerful (like turing complete) Thakns! Note: I am asking about…

  Read the article

• Is there an Unobtrusive Captcha for web forms?

  - by KP

  What is the best unobtrusive CAPTCHA for web forms? One that does not involve a UI, rather a non-UI Turing test. I have seen a simple example of a non UI CAPTCHA like the Nobot control from Microsoft. I am looking for a CAPTCHA that does not ask the user any question in any form. No riddles, no what's in this image.

  Read the article

• Power of programming languages

  - by Casebash

  Are there any objective measures for measuring the power of programming languages? Turing-completeness is one, but it is not particularly discriminating. I also remember there being a few others measures of power which are more limited versions (like finite-state-autonoma), but is there any objective measure that is more…

  Read the article

• Is there any Mathematical Model or Theory behind Programming Languages?

  - by Padmarag

  RDBMS are based on Relational Algebra as well as Codd's Model. Do we have something similar to that for Programming languages or OOP? One concept may be Turing Machine.

  Read the article

• Developing Schema Compare for Oracle (Part 1)

  - by Simon Cooper

  SQL Compare is one of Red Gate's most successful SQL Server tools; it allows developers and DBAs to compare and synchronize the contents of their databases. Although similar tools exist for Oracle, they are quite noticeably lacking in the usability and stability that SQL Compare is known for in the SQL Server world. We…

  Read the article

• OpenVPN bandwith restrictrictions and cpu power needed

  - by user197664

  In Open VPN is there a way to set a maximum limit of data and speed per user? Say user "reptar' is abusing the VPN and I wanted to limit his/her speeds and/or data how would one go about doing this? Would I need to know the IP address of the abuser? Also, I have seen articles around the internet about turing a Rasberry…

  Read the article

• Trouble "turning off" dialtone in Exchange 2010

  - by makerofthings7

  Given that there are two ways to enable dial tone, I'm having trouble turing it off. The two ways I'm aware of are: Dismount the database, delete it or rename it, mount it, Exchange will prompt for a dial tone creation. Run the command: Get-Mailbox -Database DB1 | Set-Mailbox -Database DTDB1 as described here Both…

  Read the article

• CodePlex Daily Summary for Sunday, April 11, 2010

  CodePlex Daily Summary for Sunday, April 11, 2010New ProjectsArkzia: This Silverlight game.CodePlex Wiki Editor: CodePlex Wiki Editor makes it easier for CodePlex users to create their wiki documentations.This project offer a rich interface for the edition...Evaluate: Evaluate & Comet DWR like .NET library with…

  Read the article

• So are we ever getting the technological singularity

  - by jsoldi

  I´m still waiting for an AI robot that will pass the Turing test. I keep going back to http://www.a-i.com/ and nothing. I don´t know much about AI but, did anyone ever tried to make a genetic algorithm whose evolution algorithm itself evolves? Or how about one whose algorithm that makes the genetic algorithm…

  Read the article

< Previous Page | 1 2 3 4 5  | Next Page >